Skip to content

Update InsertionSort.cpp #68

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
theSatvik wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update InsertionSort.cpp #68

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 10 additions & 8 deletions InsertionSort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,9 @@
#include<process.h>
#include<time.h>
using namespace std;
void insertionSort(int a[], int size) {

#define size 100000
void insertionSort(int a[]) {
int i, j, num;
for(j=1; j<size; j++) {
num = a[j];
Expand All @@ -16,21 +18,21 @@ void insertionSort(int a[], int size) {
}
}
int main() {
int a[100000], size=100000, ch, i;
int a[size], ch, i;
cout<<"Insertion Sort\nEnter your Choice:\n1. Best Case\n2. Worst Case\n3. Average Case\n4. Exit\t";
cin>>ch;
switch(ch) {
case 1: for(i=0; i<100000; i++) {
case 1: for(i=0; i<size; i++) {
a[i] = i+1;
}
break;
case 2: for(i=100000; i>0; i--) {
a[100000-i] = i;
case 2: for(i=size; i>0; i--) {
a[size-i] = i;
}
break;
case 3: srand(time(NULL));
for(i=0; i<100000; i++) {
a[i] = rand() % 100000 + 1;
for(i=0; i<size; i++) {
a[i] = rand() % size + 1;
}
break;
case 4: exit(0);
Expand All @@ -40,7 +42,7 @@ int main() {
}
clock_t start, end;
start = clock();
insertionSort(a, size);
insertionSort(a);
end = clock();
cout<<"Time Taken: "<<(double)(end-start)/CLK_TCK;
}