I have written the code but cannot complete the assignment please help.pdf

I have written the code but cannot complete the assignment please help me to complete.
Please don't just copy other s answers as your own.
// Insertion sort
/*
#include <ctime>
#include <iostream>
using namespace std;
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
// Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current
position
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
int main() {
int n;
cout << "Enter the size of the array: ";

cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
insertionSort(arr, num);
end = clock();
cout << "Sorted array: n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
timetaken = ((double) (end - start)) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// Shell Sort

/*
#include <ctime>
#include <iostream>
int shellSort(int arr[], int n) {
for (int gap = n/2; gap > 0; gap /= 2) {
for (int i = gap; i < n; i += 1) {
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
return 0;
}
void printArray(int arr[], int n) {
for (int i=0; i<n; i++)
cout << arr[i] << " ";
}
int main() {
int n;

cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
shellSort(arr, num);
end = clock();
cout << "nArray after sorting: n";
printArray(arr, n);
cout << endl;
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
return 0;
}
*/
// MergeSort
/*
#include <ctime>

#include <iostream>
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}

k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[], int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
int main() {
int n;

cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int arr_size = sizeof(arr) / sizeof(arr[0]);
clock_t start;
clock_t end;
double timetaken;
start = clock();
mergeSort(arr, 0, arr_size - 1);
end = clock();
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
cout << "nSorted array is n";
for (int i = 0; i < arr_size; i++)
cout << arr[i] << " ";
cout << endl;
cout << "Time taken: " << fixed << timetaken << " s" << endl;
return 0;
}
*/

// Radix Sort
/*
#include <ctime>
#include <iostream>
#include <algorithm>
#include <vector>
void countingSort(vector<int>& arr, int exp)
{
int n = arr.size();
vector<int> output(n);
vector<int> count(10, 0);
for (int i = 0; i < n; i++)
count[(arr[i] / exp) % 10]++;
for (int i = 1; i < 10; i++)
count[i] += count[i - 1];
for (int i = n - 1; i >= 0; i--) {
output[count[(arr[i] / exp) % 10] - 1] = arr[i];
count[(arr[i] / exp) % 10]--;
}
for (int i = 0; i < n; i++)
arr[i] = output[i];
}

void radixSort(vector<int>& arr)
{
int n = arr.size();
int max_val = *max_element(arr.begin(), arr.end());
for (int exp = 1; max_val / exp > 0; exp *= 10)
countingSort(arr, exp);
}
int main()
{
int n;
cin >> n;
vector<int> arr(n);
cout << "Enter " << n << " integers: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
clock_t start;
clock_t end;
double timetaken;
start = clock();
radixSort(arr);
end = clock();

timetaken = (end - start) / (double)CLOCKS_PER_SEC;
cout << "Sorted array: ";
for (int x : arr)
cout << x << " ";
cout << endl;
return 0;
}
*/
// std::sort
/*
#include <ctime>
#include <iostream>
#include <vector>
int main()
{
int n;
cin >> n;
vector<int> arr(n);

for (int i = 0; i < n; i++) {
cin >> arr[i];
}
clock_t start = clock();
sort(arr.begin(), arr.end());
clock_t end = clock();
double timetaken = double(end - start) / CLOCKS_PER_SEC;
cout << "Sorted array: ";
for (int x : arr) {
cout << x << " ";
}
cout << endl;
return 0;
}
*/
#include <ctime>
#include <iostream>
#include <vector>
int main()
{

int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
clock_t start;
clock_t end;
double timetaken;
// pre-sorted
start = clock();
end = clock();
cout << "Pre-sorted array: ";
for (int x : arr) {
cout << x << " ";
}
cout << endl;
// reverse-sorted

reverse(arr.begin(), arr.end());
start = clock();
end = clock();
cout << "Reverse-sorted array: ";
for (int x : arr) {
cout << x << " ";
}
cout << endl;
// rand%N
random_shuffle(arr.begin(), arr.end());
start = clock();
end = clock();
cout << "Rand%N array: ";
for (int x : arr) {
cout << x << " ";
}
cout << endl;

// rand%10
for (int i = 0; i < n; i++) {
arr[i] = rand() % 10;
}
start = clock();
end = clock();
cout << "Rand%10 array: ";
for (int x : arr) {
cout << x << " ";
}
cout << endl;
// zeros
for (int i = 0; i < n; i++) {
arr[i] = 0;
}
start = clock();
end = clock();
cout << "Zeros array: ";

for (int x : arr) {
cout << x << " ";
}
cout << endl;
return 0;
}
Sorting experiments In this assignment, you will implement 5 different sorting algorithms and
test their performance on different types of input. You may use any of the code provided on
moodle so far. Algorithms: - Insertion sort - Shell sort - Mergesort - Quicksort - Radix sort -
std::sort (on std::vector, it is already implemented in ) Input types - Pre-sorted array from 1..N -
Reverse-sorted array from N..1 - Random array with few duplicates (use rand()%N) - Array
with many duplicates (use rand()%10) - Array of all duplicates (all zeros) For each type of input
array, test on 5 different sizes: N = 100 , N = 1000 , N = 10000 , N = 100000 , N = 1000000
Results: Provide the results of your sorting experiments in 5 separate tables (one for each input
size) as follow: Discuss and justify your results. Which algorithm performs best overall (when
averaging across all input sizes and input types)? Be sure to mention time complexity when
discussing your results. Also, be sure to used std::move whenever possible in your c + +
implementations, and test in release mode. Submit your c++ source code as well as a pdf
containing your name, the required tables ( 5 x ) and your discussion of the results. if an
algorithm takes > 2 minutes on any of the input sizes, you can stop the Bonus + 5 % : improving
your sorting algorithms - Use insertion sort on the divided sub-arrays of mergesort once they get
below a certain size - This speeds up mergesort because it removes the need for copying
elements into new arrays, which adds a lot of overhead to the running time - Use a random pivot
for quicksort to improve its running time on the pre-sorted and reversesorted arrays - Try
different gap sequences for shell sort

I have written the code but cannot complete the assignment please help.pdf

Recommended

More Related Content

Similar to I have written the code but cannot complete the assignment please help.pdf (20)

More from shreeaadithyaacellso (20)

Recently uploaded (20)

I have written the code but cannot complete the assignment please help.pdf