Implement the following sorting algorithms Bubble Sort Inser

Implement the following sorting algorithms: Bubble Sort. Insertion Sort. Selection Sort. Merge Sort. Heap Sort. Quick Sort. For each of the above algorithms, measure the execution time based on input sizes n, n + 10(i), n + 20(i), n + 30(i), ..., n + 100(i) for n = 50000 and i = 100. Let the array to be sorted be randomly initialized. Use the same machine to measure all the algorithms. Plot a graph to compare the execution times you collected in part (2).

Solution

1)

1)bubble sort in c++

#include <iostream>

using namespace std;

//The is the Bubble Sort function

void bubble_sort_functon (int array[], int n)

{

  for (int i = 0; i < n; ++i)

    for (int j = 0; j < n - i - 1; ++j)

      if (array[j] > array[j + 1])

     {

        int temp = array[j];

        arry[j] = array[j + 1];

        array[j + 1] = temp;

      }

  }         

//This is the driver Function

int main()

{

  int input_array[] = {10, 20,15,18,90,200,11};

  int n = sizeof (input_array) / sizeof (input_array[0]);

  bubble_sort_function (input_array, n);

  cout << \"The sorted Array is : \" << endl;

  for (int i = 0; i < n; ++i)

    cout << input_array[i] << \" \";

  return 0;

}

2)Insertion sort in c++

3.Selection sort in c++:

4.Merge sort in c++