$($CSCI $251)$ Project $1$: Compare Sorting Algorithms

Project Description:

In this project, students are required to implement the following algorithms: Insertion Sort, selection Sort, Quick Sort, and Merge Sort. The implementation can be done in

C$++.$

For C$++$ implementation, MySortsCPP.cpp file is provided. Do not modify the main

function and testsort function. Kindly modify the other functions and implement the

above stated sorting algorithms; namely, InsertSort, SelectSort, QuickSort and MergeSort.

Run Demo:

For Java, you may use different IDE platforms to run the implementations. For IDE runs,

students may use Eclipse, BlueJ or any java$-$based IDE to run their files. For C$++,$ run the

implementation using any IDE of your choice, for example, Microsoft Visual Studio.

Submission:

There are two deliverable items for this project. These are outlined below

$(1)$ Submit only one code implementation file, that is$,$ either MySorts.java $($for Java

implementation$)$ or MySortsCPP.cpp $($for C$++$ implementation$).[80$ points$]$

$(2)$ Submit a document file. In this file, you're to comment on the performance of each sort

algorithm in comparison to other algorithms. $[20$ points$]$

$($a$)$ Which algorithm is the fastest and which one is the slowest? In your estimation,

what makes one algorithm work faster than another?

$($b$)$ Could any of these performance results change in the face of a larger data size?

Both code implementation and document files are supposed to be submitted together on

Blackboard project submission portal.