Question

Practical 5: Write a program that implements several sorting algorithms, and use it to demonstrate the comparative performance of the algorithms for a variety of data sets.

Need Help With this Sorting Algorithm task for C++

Base Code for sorting.cpp is given.

The header file is not included in this. Help would be much appreciated as I have not started on this due to personal reasons

#include <cstdlib>
#include <iostream>

#include <getopt.h>

using namespace std;

long compares; // for counting compares
long swaps;    // for counting swaps

bool counted_less(int n1, int n2)
{
    ++compares;
    return n1 < n2;
}

void counted_swap(int &n1, int &n2)
{
    ++swaps;
    int t = n1;
    n1 = n2;
    n2 = t;
}

void selectionSort(int *start, int *stop)
{
    // add code here
}

void insertionSort(int *start, int *stop)
{
    // add code here
}

void quickSort(int *start, int *stop)
{
    // add code here
}

void merge(int *start, int *mid, int *stop)
{
    int temp[stop - start];

    int *i = start;
    int *j = mid;
    int *k = temp;

    while (i < mid || j < stop) {
        if (i == mid) {
            counted_swap(*k++, *j++);
        } else if (j == stop) {
            counted_swap(*k++, *i++);
        } else if (counted_less(*j, *i)) {
            counted_swap(*k++, *j++);
        } else {
            counted_swap(*k++, *i++); // bias to left for stability
        }
    }

    for (i = start, k = temp; i != stop; ++i, ++k) {
        counted_swap(*i, *k);
    }
}

void mergeSort(int *start, int *stop)
{
    if (stop - start <= 1)
        return;
    int *mid = start + (stop - start) / 2;
    mergeSort(start, mid);
    mergeSort(mid, stop);
    merge(start, mid, stop);
}

int main(int argc, char **argv)
{
    string algorithm = "selection sort";
    string dataset   = "random";
    int size         = 1000;

    for (int c; (c = getopt(argc, argv, "ravmqsi")) != -1;) {
        switch (c) {
        case 'r':
            dataset = "random";
            break;
        case 'a':
            dataset = "already sorted";
            break;
        case 'v':
            dataset = "reversed";
            break;
        case 'm':
            algorithm = "merge sort";
            break;
        case 'q':
            algorithm = "quicksort";
            break;
        case 's':
            algorithm = "selection sort";
            break;
        case 'i':
            algorithm = "insertion sort";
            break;
        }
    }

    argc -= optind;
    argv += optind;

    if (argc > 0)
        size = atoi(argv[0]);

    int *data = new int[size];

    if (dataset == "already sorted") {
        for (int i = 0; i < size; ++i)
            data[i] = i;
    } else if (dataset == "reversed") {
        for (int i = 0; i < size; ++i)
            data[i] = size - i - 1;
    } else if (dataset == "random") {
        for (int i = 0; i < size; ++i)
            data[i] = rand() % size;
    }

    compares = 0;
    swaps    = 0;

    if (algorithm == "merge sort") {
        mergeSort(data, data + size);
    } else if (algorithm == "quicksort") {
        quickSort(data, data + size);
    } else if (algorithm == "selection sort") {
        selectionSort(data, data + size);
    } else if (algorithm == "insertion sort") {
        insertionSort(data, data + size);
    }

    for (int i = 1; i < size; ++i) {
        if (data[i] < data[i - 1]) {
            cout << "Oops!" << endl;
            exit(1);
        }
    }

    cout << "Algorithm: " << algorithm << endl;
    cout << "Dataset:   " << dataset << endl;
    cout << "Size:      " << size << endl;

    // uncomment for checkpoints 3 and 4
    // cout << "Compares:  " << compares << endl;
    // cout << "Swaps:     " << swaps << endl;
}

Practical 5: Sorting to Task Winks poyan er impje of the algorithms for a data sets Background The skeleton program sorting.cpp contains a main function for testing the operation of several sort algorithms over various data sizes and data set organisations. The program understands the following options: insertion sort -s selection sort (the default) -qquicksort merge sort -a already-sorted data set - reverse-sorted data set -r random data set (the default) generate a data set of size n (default 10,000) Level 1: Basic sorts Implement the selectionSort and insertionSort functions. Note that you can base your code on the sample code used in lectures, although you'll need to change it from passing the data using an array and 2 indexes to passing it using two pointers Level 2: Quicksort Implement the quickSort function. The real work of quicksort happens in the partition operation, so it's probably best to define a separate function to do the partitioning. Level 3: Profiling For this checkpoint you need to gather data about the number of times that each algorithm compares or swaps items. A simple strategy is to use functions to do the count variables inside the functions. The skeleton program provides the functions counted_less and counted_swap for just this purpose. To use them, modify your code to call the functions where appropriate then uncomment the code that displays the final values of the count variables. comparisons and swaps, and then increment

Answer 1

to a Series made eyoithn takes Serting input instructions aperotions List he pefaoms Cadiol it Apeiped just means gaeory anfe auothes aliye alseaetiy ianto slesnessts either ith lin Oroles the awray let 737, 2 3 1,25 aedig dinieg 2,7,25, 74, 29 3913 4426, 2 Aarn ting in a order iat main 2 int A-34,11,4,56, 73,9, IS 29, } int i bubble sort {A, 9} Aax Lizoi-8itt) printf ('" ed ALUJ Void brubsle tint Aint N) Tound temp iat 12 for Lraund l YoundEN-1Yound t) forl izo is2N1-rondit) 14 15

logeli temp Al AL ALit AStil If 20 tempy 21 22 4 4l1a9 23 printf ( Rourdd n" 1ourd) 25 return 26 27 output' LL89 11 1S 29 3456 78