| |
L.A.23.1 - Quadratics | page 10 of 10 |
Instructions:
Add the code for the 3 quadratic sorting algorithms to the sorting template program. Add the appropriate lines of code to count the number of steps for each algorithm. The student outline has provided an example for the swap and bubbleSort functions.
Test each sorting algorithm for the number of steps to sort 100, 200, 400 and 800 integers.
Record your answers below
Recursive mergesort and quicksort will be studied in later lessons.
You will turn in this lab sheet after the conclusion of Lesson 26.
| 100 integers
| 200 integers
| 400 integers
| 800 integers
| BubbleSort
| _______________
| _______________
| _______________
| _______________
| SelectionSort
| _______________
| _______________
| _______________
| _______________
| InsertionSort
| _______________
| _______________
| _______________
| _______________
| MergeSort (recursive)
| _______________
| _______________
| _______________
| _______________
| QuickSort
| _______________
| _______________
| _______________
| _______________
|
|