[ create a new paste ] login | about

Link: http://codepad.org/AoNOSQXL    [ raw code | output | fork ]

C++, pasted on Sep 27:
#include <stdio.h>
#include <stdlib.h>

#define N 20

void swap(int& n1, int& n2)
 { int _tn = n1; n1 = n2; n2 = _tn; }

int main()
{
	int* A = new int[N];
	for (int n1 = 0; n1 < N; n1++)
	{
		A[n1] = rand() % (N-1) + 1;
		printf("%d ",A[n1]);
	}

	printf("\n");

	bool descend = false;
	for (int n2 = 0; n2 < N && !descend; n2++)
		descend = (A[n2] < A[n2+1]) ? 1 : 0;

	for (int i = 0; i < N; i++)
		for (int j = i+1; j < N; j++)
			if (A[j] > A[i]) swap(A[i],A[j]);

	for (int m = 0; m < N; m++)
		printf("%d ",A[m]);
	printf("\n");

	return 0;
}


Output:
1
2
3 16 4 4 11 9 11 12 3 8 2 10 2 11 2 11 8 18 6 10 
18 16 12 11 11 11 11 10 10 9 8 8 6 4 4 3 3 2 2 2 


Create a new paste based on this one


Comments: