Question

Data Structure using C++ only

Write 4 different sorting functions: Selection Sort, Insertion Sort, Merge Sort and Quick sort. For each sort you may store the numbers in an array or a linked list (this may be different for each sort). Write your program so that it accepts arguments from the command line using argc and argv in the main function call.

Answer 1

Hi Friend, Implementing all sorting algorithm in one post is too big.

I have implemented Selction Sort.

Please repost for other in separate post.

#include <iostream>
using namespace std;

void swap(int &xp, int &yp)
{
int temp = xp;
xp = yp;
yp = temp;
}

void selectionSort(int arr[], int n)
{
int i, j, min_idx;

// One by one move boundary of unsorted subarray
for (i = 0; i < n-1; i++)
{
// Find the minimum element in unsorted array
min_idx = i;
for (j = i+1; j < n; j++)
if (arr[j] < arr[min_idx])
min_idx = j;

// Swap the found minimum element with the first element
swap(arr[min_idx], arr[i]);
}
}

/* Function to print an array */
void printArray(int arr[], int size)
{
int i;
for (i=0; i < size; i++)
cout<<arr[i]<<" ";
cout<<endl;
}

// Driver program to test above functions
int main()
{
int arr[] = {56, 12, 34, 64, 25, 12, 22, 11};
int n = sizeof(arr)/sizeof(arr[0]);
selectionSort(arr, n);
cout<<"Sorted array: \n";
printArray(arr, n);
return 0;
}

fourthweek fourthweek fourthweek fourthweek g++ selectionSort.cpp fourthweek ./a.out Sorted array: 11 12 12 22 25 34 56 64 fourthweek