forked from hacktoberfest2k20/DataStructures-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Selection_Sort.cpp
59 lines (47 loc) · 1.06 KB
/
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
55
56
57
58
59
//Selection Sort
//Time Complexity: O(n^2)
//Auxiliary Space: O(1)
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
void PrintArray(vector<int> &arr)
{
for (int ele : arr)
cout << ele << " ";
cout << endl;
}
void SelectionSort(vector<int> &arr)
{
for (int i = 0; i < arr.size() - 1; i++)
{
int temp = arr[i];
int loc = i;
for (int j = i + 1; j < arr.size(); j++)
{
if (arr[j] < temp)
{
temp = arr[j];
loc = j;
}
}
temp = arr[loc];
arr[loc] = arr[i];
arr[i] = temp;
}
cout << "Array after sorting:" << endl;
PrintArray(arr);
}
int main(int args, char **argv)
{
int n;
cout << "Enter size of Array:";
cin >> n;
vector<int> arr(n, 0);
//Creates a Array containing randomly generated Integers upto 10000
for (int i = 0; i < n; i++)
arr[i] = (rand() % 10000) + 1;
cout << "Initial Array:" << endl;
PrintArray(arr);
SelectionSort(arr);
}