FilesExpand file tree

 master

/

InsertSort.h

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

42 lines (38 loc) · 691 Bytes

 master

/

InsertSort.h

Top

File metadata and controls

• Code
• Blame

42 lines (38 loc) · 691 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

29

30

31

32

33

34

35

36

37

38

39

40

41

42

//

// Created by intje on 2019/9/6.

//

#ifndef SORTING_CPP_INSERTSORT_H

#define SORTING_CPP_INSERTSORT_H

#include <iostream>

using namespace std;

template <typename T>

void InsertSort(T A[], int n) {

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

T e = A[i];

int j;

for(j = i; j > 0 && A[j-1] > e; j--) {

A[j] = A[j-1];

}

A[j] = e;

}

}

template <typename T>

void BinaryInsertSort(T A[], int n) {

int mid;

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

T e = A[i];

int lo = 0, hi = i - 1;

while(lo <= hi) {

mid = (lo + hi)/2;

if(e > A[mid])

lo = mid + 1;

else

hi = mid - 1;

}

for(int j = i; j > lo; j--) {

A[j] = A[j-1];

}

A[lo] = e;

}

}

#endif //SORTING_CPP_INSERTSORT_H