-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2.1InsertionSort.cpp
More file actions
55 lines (46 loc) · 940 Bytes
/
2.1InsertionSort.cpp
File metadata and controls
55 lines (46 loc) · 940 Bytes
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
#if 0
#include <cstdlib>
#include <iostream>
#include<vector>
using namespace std;
int main(int argc, char *argv[])
{
//cout<<"i am a boy!"<<endl;
bool Insertion_sort(vector<int>::iterator begin,vector<int>::iterator end);
vector<int> ivec;
ivec.push_back(5);
ivec.push_back(2);
ivec.push_back(4);
ivec.push_back(6);
ivec.push_back(1);
ivec.push_back(3);
for(vector<int>::size_type i=0;i<ivec.size();i++)
{
cout<<ivec[i]<<endl;
}
cout<<endl;
Insertion_sort(ivec.begin(),ivec.end());
for(vector<int>::size_type i=0;i<ivec.size();i++)
{
cout<<ivec[i]<<endl;
}
system("PAUSE");
return EXIT_SUCCESS;
}
void Insertion_sort(vector<int>::iterator begin,vector<int>::iterator end)
{
for(vector<int>::iterator it=begin+1;it!=end;it++)
{
int key=*it;
for(vector<int>::iterator itj=it-1;itj!=begin-1;itj--)
{
if(*itj>key)
{
*(itj+1)=*itj;
*itj=key;
}
else break;
}
}
}
#endif