-
Notifications
You must be signed in to change notification settings - Fork 5
/
selection_sort.c
70 lines (56 loc) · 1.04 KB
/
selection_sort.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <stdio.h>
#include <stdlib.h>
void swap(int *, int *);
/**
* Selection sort algorithm.
*
* @param int input Array to sort
* @param int n Number of data in search array
*
* @return void
*/
void selection_sort(int *input, int n)
{
int min;
for (int i = 0; i < n - 1; i++) {
min = i;
for (int j = i + 1; j < n; j++) {
if (input[j] < input[min]) {
min = j;
}
}
if (min != i) {
swap(input + i, input + min);
}
}
}
/**
* Swap two integers.
*
* @param int a
* @param int b
*
* @return void
*/
void swap(int *a, int *b)
{
int temp = *b;
*b = *a;
*a = temp;
}
int main()
{
int n;
printf("How many numbers? ");
scanf("%d", &n);
int *input = (int *) malloc(n * sizeof(int));
printf("Enter %d numbers: ", n);
for (int i = 0; i < n; i++) {
scanf("%d", input + i);
}
selection_sort(input, n);
for (int i = 0; i < n; i++) {
printf("%d\t", *(input + i));
}
free(input);
}