-
Notifications
You must be signed in to change notification settings - Fork 0
/
insertSort.cpp
54 lines (50 loc) · 1.35 KB
/
insertSort.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>
#include <cstdlib>
#include <vector>
using namespace std;
void insertSort(vector <int>& nonSortedVector)
{
for (int i = 1; i < nonSortedVector.size(); i++)
{
int key = nonSortedVector[i];
int j = i - 1;
while ((j >= 0) && (nonSortedVector[j] > key))
{
nonSortedVector[j + 1] = nonSortedVector[j];
j--;
}
nonSortedVector[j + 1] = key;
}
}
int findInsertionPlace(vector <int>& nonSortedVector, int pointSearched, int left, int right)
{
int middle = (right - left) / 2 + left;
if ((left == right))
{
if (nonSortedVector[left] < nonSortedVector[pointSearched])
return left + 1;
else
return left;
}
else if (nonSortedVector[middle] == nonSortedVector[pointSearched])
return middle;
else if (nonSortedVector[middle] < nonSortedVector[pointSearched])
return findInsertionPlace(nonSortedVector, pointSearched, middle+1, right);
else
return findInsertionPlace(nonSortedVector, pointSearched, left, middle);
}
void insertSortBinary(vector <int>& nonSortedVector)
{
for (int i = 1; i < nonSortedVector.size(); i++)
{
int key = nonSortedVector[i];
int insertionPlace = findInsertionPlace(nonSortedVector, i, 0, i-1);
int j = i - 1;
while (j >= insertionPlace)
{
nonSortedVector[j + 1] = nonSortedVector[j];
j--;
}
nonSortedVector[j + 1] = key;
}
}