You've already forked linux-packaging-mono
Imported Upstream version 6.4.0.137
Former-commit-id: 943baa9f16a098c33e129777827f3a9d20da00d6
This commit is contained in:
parent
e9207cf623
commit
ef583813eb
39
external/llvm/projects/llvm-cbe/test/selectionsort/main.c
vendored
Normal file
39
external/llvm/projects/llvm-cbe/test/selectionsort/main.c
vendored
Normal file
@ -0,0 +1,39 @@
|
||||
#include <stdio.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
int array[100], n, c, d, position, swap;
|
||||
|
||||
printf("Enter number of elements\n");
|
||||
scanf("%d", &n);
|
||||
|
||||
printf("Enter %d integers\n", n);
|
||||
|
||||
for (c = 0; c < n; c++)
|
||||
scanf("%d", &array[c]);
|
||||
|
||||
for (c = 0; c < (n - 1); c++)
|
||||
{
|
||||
position = c;
|
||||
|
||||
for (d = c +1; d < n; d++)
|
||||
{
|
||||
if (array[position] > array[d])
|
||||
position = d;
|
||||
}
|
||||
if (position != c)
|
||||
{
|
||||
swap = array[c];
|
||||
array[c] = array[position];
|
||||
array[position] = swap;
|
||||
}
|
||||
}
|
||||
|
||||
printf("Sorted list in ascending order:\n");
|
||||
|
||||
for (c = 0; c < n; c++)
|
||||
printf("%d\n", array[c]);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
Reference in New Issue
Block a user