Repository navigation
Expand file tree
/
Copy pathSorting.cpp
More file actions
122 lines (103 loc) · 2.4 KB
/
Copy pathSorting.cpp
File metadata and controls
122 lines (103 loc) · 2.4 KB
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <iostream>
using namespace std;
void selectionSort(int arr[],int size){
// Unstable sorting algorithm
// smallest element se element ko swap karte jaenge
for (int i = 0; i < size; i++)
{
int minindex = i;
for (int j = i+1; j < size; j++)
{
if (arr[j]<arr[minindex])
{
minindex = j;
}
}
int temp = arr[i];
arr[i] = arr[minindex];
arr[minindex] = temp;
}
for (int i = 0; i < size; i++)
{
cout<<arr[i]<<endl;
}
}
void bubbleSort(int arr[],int n){
// Stable sorting algorithm
// "i" sirf loop k lie h jo i=0 se i=n-1 tak chalega .
// Biggest element last me settle hota jaega.
for (int i = 0; i < n-1; i++)
{
for (int j = 0; j < n-i-1; j++)
{
if (arr[j]>arr[j+1])
{
swap(arr[j],arr[j+1]);
}
}
}
for (int i = 0; i < n; i++)
{
cout<<arr[i]<<endl;
}
}
void insertionSort(int arr[],int n){
for (int i = 1; i < n; i++)
{
// temp me arr[i] store kr lia ab ise sabse compare kar lenge.
// shuru se array ko sort karte jaenge. first element ko sorted assume karenge.
int temp = arr[i];
int j = i-1;
for (j; j >= 0; j--)
{
if (arr[j]>temp)
{
arr[j+1] = arr[j];
}
else{
break;
}
}
arr[j+1] = temp;
}
for (int i = 0; i < n; i++)
{
cout<<arr[i]<<endl;
}
}
void heapify(int arr[],int n,int i){
int largest = i;
int left = 2*i+1;
int right = 2*i + 2;
if(left<n && arr[largest]<arr[left])
largest = left;
if(right<n && arr[largest]<arr[right])
largest = right;
if(largest!=i){
swap(arr[largest],arr[i]);
heapify(arr,n,largest);
}
}
void heapSort(int arr[],int n){
while (n>1)
{
swap(arr[0],arr[n-1]);
n--;
heapify(arr,n,0);
}
}
int main(){
int arr[] = {12,6,11,2,3};
// insertionSort(arr,7);
int n = 5;
for(int i = n/2-1; i >=0 ; i--)
{
heapify(arr,n,i);
}
heapSort(arr,5);
for (int i = 0; i < 5 ; i++)
{
cout<<arr[i]<<" ";
}cout<<endl;
return 0;
}