-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSelection_sort.c
More file actions
53 lines (46 loc) · 907 Bytes
/
Selection_sort.c
File metadata and controls
53 lines (46 loc) · 907 Bytes
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
// Selection Sort
#include<stdio.h>
void selection_sort(int arr[], int n)
{
int min,i,j,t;
for (i = 0; i < n - 1; i++)
{
min = i;
for (j = i+1; j < n; j++)
{
if(arr[min]>arr[j])
{
min = j;
}
}
if (min != i)
{
t = arr[i];
arr[i] = arr[min];
arr[min] = t;
}
}
}
int main()
{
int arr[40], n, i;
printf("Enter size of Array\n");
scanf("%d", &n);
printf("Enter Array Elements\n");
for (i = 0; i < n; i++)
{
scanf("%d", &arr[i]);
}
printf("Before Sorting The array is\n");
for (i = 0; i < n; i++)
{
printf("%d ", arr[i]);
}
selection_sort(arr, n);
printf("\nAfter Sorting The array is\n");
for (i = 0; i < n; i++)
{
printf("%d ", arr[i]);
}
return 0;
}