-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSelection_Sort.c
79 lines (69 loc) · 1.12 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
71
72
73
74
75
76
77
78
79
//This is Selection Sort Program in C language
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
struct ar
{
int n;
int a[100];
};
void getdata(struct ar *l)
{
int z;
printf("\nYou can enter Maximum 100 Data.\nHow many number of data You Want to enter : ");
scanf("%d",&z);
l->n = z-1;
//printf("\nEnter Data : ");
srand(time(0));
for (int i = 0; i < z; i++)
{
//scanf("%d",&l->a[i]);
l->a[i] = rand()%100;
printf(" ");
}
}
int sortdata(struct ar *l)
{
int min,temp,flag;
for(int i=0;i<l->n;i++)
{
min=i;
flag=1;
for(int j=i+1;j<=l->n;j++)
{
if(l->a[min] > l->a[j])
{
min = j;
}
if (l->a[j-1] > l->a[j])
{
flag = 0;
}
}
if(flag == 1)
{
return 0;
}
temp = l->a[i];
l->a[i] = l->a[min];
l->a[min] = temp;
}
return 0;
}
void printdata(struct ar *l)
{
printf("\nSorted data : ");
for(int i=0;i<=l->n;i++)
{
printf(" %d",l->a[i]);
}
printf("\n");
}
int main()
{
struct ar l;
getdata(&l);
sortdata(&l);
printdata(&l);
return 0;
}