FilesExpand file tree

 main

/

insertionssort.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

28 lines (26 loc) · 550 Bytes

 main

/

insertionssort.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

28 lines (26 loc) · 550 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include<bits/stdc++.h>

using namespace std;

/*

TC = O(n^2)

Stable sort

Adjacent sorting algo of bubble and insertion are stable

*/

int main(){

int arr[] = {5,3,4,2,1};

int n = 5;

for(int i=1;i<n;i++){

// for(int j=i;j>=0;j--){

// if(arr[j]<arr[j-1]){

// swap(arr[j],arr[j-1]);

// }else break;

// }

int j = i;

while(j>=1 && arr[j]<arr[j-1]){

swap(arr[j],arr[j-1]);

j--;

}

}

for(int ele:arr){

cout<<ele<<" ";

}

}