forked from BitSails/algos
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort.cpp
More file actions
68 lines (54 loc) · 1.43 KB
/
sort.cpp
File metadata and controls
68 lines (54 loc) · 1.43 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
#include <iostream>
#include <cstdlib>//for "exit()" on some systems
#include <vector>
#include <string>
using namespace std;
/**
\fn linearSearch
\brief Search data for the first occurrence of key
\param [in] key The value being searched for
\param [in] data The data set that will be searched
\returns location of key if found or -1 if not found
*/
void insertionSort(auto& inputs)
{
for(int i=1; i < inputs.size(); i++)
{
int j=i;
int count=0;
while(j<0&&(inputs[j]<inputs[j-1]))
{
swap(inputs[j],inputs[j-1]);
j--;
count=count+1;
}
}
}
int main()
{
vector<string> inputs;
string search_key, input;
cout<<"Welcome to \"sort it\". We first need some input data."<<endl;
cout<<"We'll assume the inputs do not have any spaces."<<endl<<endl;
cout<<"To end input type the #-character (followed by Enter)"<<endl<<endl;
cin>>input;
while(input != "#")//read an unknown number of inputs from keyboard
{
inputs.push_back(input);
cin>>input;
}
cout<<endl<<"["<<inputs.size()<<" values read from input source]"<<endl<<endl;
if(inputs.size() == 0)//no input
{
cout<<endl<<"No input received, quiting..."<<endl<<endl;
exit(1);//nothing to do but quit program
}
insertionSort(inputs);
for(int i=1;i<=inputs.size();i++)
{
cout<<inputs[i];
}
cout<<endl<< "Number of times"<<count;
cout<<endl<<"Program \"sort it\" is now finished."<<endl<<endl;
return 0;
}