-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquestionB.cpp
More file actions
78 lines (70 loc) · 1.46 KB
/
Copy pathquestionB.cpp
File metadata and controls
78 lines (70 loc) · 1.46 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
69
70
71
72
73
74
75
76
77
78
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include<fstream>
#include "Clock.cpp"
using namespace std;
void insertion_sort(vector<int>&v)
{int insert, moveItem;
for(int next=0;next<v.size();next++)
{
insert = v.at(next);
moveItem = next;
while((moveItem>0) &&
(v.at(moveItem-1) > insert))
{
v.at(moveItem) = v.at(moveItem-1);
--moveItem;
}
v.at(moveItem) = insert;
}
}
int main(){
ifstream fptr;
int size1,i,sum=0,j;
fptr.open("file.in",ios::in);
if(fptr==0)
cout<<"Failure opening"<<endl;
else{
fptr>>size1;
vector<int>a(size1),a2(size1);
for(i=0;i<size1;i++)
fptr>>a.at(i);
a2=a;
Clock clk;
int size =a.size();
/*vector<int> v1(size),v2;
srand(time(NULL));
for(int i=0; i<size; ++i)
v1.at(i) = rand();
v2 = v1; */
clk.start();
sort(a.begin(), a.end());
cout << "sort(): " <<clk.getElapsedTime() << " seconds\n";
//cout<<"v1/v2 are "<<((v1==v2)?"the same.\n":"different.\n");
clk.start();
/*for(i=0;i<8;i++)
cout<<a.at(i)<<" "<<endl;*/
insertion_sort(a2);
j=size1-1;
for(i=0;i<5;i++){
sum=sum+a.at(j);
j--;
}
cout << "insertion_sort(): "<<clk.getElapsedTime() << " seconds\n";
//cout << "v1/v2 are "<<((v1==v2)?"the same.\n":"different.\n");
cout<<endl<<sum;
return 0;
}
}
/*int i,j,buffer;
for(i=0;i<v.size()-1;i++){
for(j=i;j<v.size();j++){
if(v.at(i)>v.at(j))
{buffer=v.at(i);
v.at(i)=v.at(j);
v.at(j)=buffer;
}
}
}*/