1
Student Name: __________________
Class and Section __________________
Total Points (20 pts) __________________
Due: Monday Oct 21, 2019 before the class
Project: Execution time for Sorting
CSCI 3230 Data Structures
Georgia Southern University
Problem Description:
Write a program that obtains the execution time of selection sort, radix sort,
bubble sort, merge sort, quick sort, and heap sort for input size 50000, 100,000,
150,000, 200,000, 250,000, and 300,000. Your program should create data
randomly and print a table like this:
Selection Sort
Radix Sort
Bubble Sort
Merge Sort
Quick Sort
Heap Sort
50000
Array size
100000
In the same program, obtain the execution time of selection sort, radix sort,
bubble sort, and heap sort for input size given in the preceding table.
(Hint: You can use the code template below to obtain the execution time.)
Code:
Name the program Exercise23_13
Print the source code for your main method and for Radix Sort method.
2
Test:
Give me the screen shot of the table.
What to submit?
1. Email me this document.