forked from ashvish1831/hactoberfests
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSelection Sort.cpp
54 lines (44 loc) · 886 Bytes
/
Selection Sort.cpp
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
#include<iostream>
using namespace std;
int SelectionSort(int arr[], int n)
{
int s=0;
int e=n;
while(s<e){
int min=arr[s],x=s;
for(int j=s;j<e;j++)
{
if(arr[j]<min)
{
min=arr[j];
x=j;
}
}
int temp=arr[s];
arr[s]=min;
arr[x]=temp;
s++;
}
for(int i=0;i<n;i++){
cout<<arr[i]<<endl;
}
}
int main()
{
int n;
cout<<"Enter Number of Elements in array:";
cin>>n;
int arr[n];
cout<<"\nEnter "<<n<<" Elements in array:-"<<endl;
for(int i=0;i<n;i++){
cout<<"\nEnter Element "<<i+1<<":";
cin>>arr[i];
}
cout<<"\nBefore Sorting:"<<endl;
for(int i=0;i<n;i++){
cout<<arr[i]<<endl;
}
cout<<"\nAfter Sorting:"<<endl;
SelectionSort(arr, n);
return 0;
}