[ create a new paste ] login | about

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

C, pasted on Dec 12:
#include <stdio.h>
#include <stdlib.h>


int main(void)
{
	int array[] = {421,4,-3,-343,434,903,-987,678,-1000,1000,543,323,0,-230,888};
	int arraysize = sizeof(array)/sizeof(array[0]);
	int i, j;
	int max,max_index,temp;
	
	printf("元々の配列\n");
	for(i = 0;i < arraysize;i++){
		printf("%d ",array[i]);
	}
	
	for(i = 0;i < arraysize-1; i++){
		max = array[i];
		max_index = i;
		for(j = i+1;j < arraysize;j++){
			if(max < array[j]){
				max = array[j];
				max_index = j;
			}
		}
		if( max_index != i ){
			temp = array[i];
			array[i] = array[max_index];
			array[max_index] = temp;
		}
	}
	
	printf("\n大きい順\n");
	for(i = 0;i < arraysize;i++){
		printf("%d ",array[i]);
	}
	
	printf("\n小さい順\n");
	for(i = 0;i < arraysize;i++){
		printf("%d ",array[arraysize - i - 1]);

	}
	return 0;
}


Output:
1
2
3
4
5
6
元々の配列
421 4 -3 -343 434 903 -987 678 -1000 1000 543 323 0 -230 888 
大きい順
1000 903 888 678 543 434 421 323 4 0 -3 -230 -343 -987 -1000 
小さい順
-1000 -987 -343 -230 -3 0 4 323 421 434 543 678 888 903 1000 


Create a new paste based on this one


Comments: