Cod sursa(job #1521291)

Utilizator Dddarius95Darius-Florentin Neatu Dddarius95 Data 10 noiembrie 2015 08:50:31
Problema Sortare prin comparare Scor 40
Compilator c Status done
Runda Arhiva educationala Marime 0.72 kb
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#define NMAX 100

void swap(int *p, int *q) {
	int tmp = *p;
	*p = *q;
	*q = tmp;
}


void print(FILE *g, int *v, int n) {
	int i;
	for (i =  1; i <= n; i++) {
		fprintf(g, "%d%c", v[i] , (i<n? ' ' : '\n' ));
	}
}



void bubbleSort(int *v, int n) {
	int i, j;
	for (i = 1; i < n; i++) {
		for (j = n; j >= i+1; j--) {
			if (v[j] < v[i]) {
				swap(&v[i], &v[j]);
			}
		}
	}
}

int main() {
	FILE *f = fopen("algsort.in", "r");
	FILE *g = fopen("algsort.out", "w");
	srand(time(NULL));

	int n, *v,i;
	fscanf(f,"%d", &n);
	v = (int *)malloc((n+1) * sizeof(int));
	
	for (i =  1; i <= n; i++) {
		fscanf(f,"%d", &v[i]);
	}
	bubbleSort(v, n);
	print(g, v, n);
	free(v);
	return 0;
}