CSE 116 Lecture Notes - Lecture 6: Merge Sort, Quicksort, Insertion Sort
1 Jul 2017
School
Department
Course
Professor
Document Summary
Cse 116 intro to computer science ii. The problem to be solved is a comparison of 4 different sort methods. The algorithms are mergesort, quicksort, insertion sort and bubblesort. The traditional wisdom concerning the efficiency of these algorithms is that the fastest sort on large numbers of data items is the quicksort followed by the mergesort, then the insertion sort and slowest of the four, the bubblesort. The point of the exercise is three-fold: to find, modify and use code from the internet, to find the appropriate sort algorithm to use for a specific class of problem and, to produce a professional-looking, well-documented, printed paper. There are many sites on the web where the required algorithms and even complete codes can be found. Your task is to find/modify/write running test programs for each of the four sort methods. You should create use 4 separate testing programs since we want the tests to be completely independent.
