University of Nevada Las Vegas
Howard R. Hughes
College of Engineering
School of Computer Science
My Home Page
Computer Science 477/677: Design and Analysis of Algorithms
Programming Problem: In Situ Sorting
Revised October 13, 2005.
Implement the various in situ sorting algorithms we have
dicussed in class. Your program should input an array of integers,
and sort it using each of the following algorithms:
-
bubblesort
-
array selection sort
-
array insertion sort
-
quicksort
-
heapsort
-
shellsort
-
any other in situ sorting algorithm that you find in a book
or think up yourself
Each time, measure the number of comparisons made and the number of times
a value is moved. Your program should write a summary comparing the
performance of the various algorithms on your input.