Skip to main content
ICT
Lesson A17 - Quadratic Sorting Algorithms
 
Main Previous
Title Page >  
Summary >  
Lesson A1 >  
Lesson A2 >  
Lesson A3 >  
Lesson A4 >  
Lesson A5 >  
Lesson A6 >  
Lesson A7 >  
Lesson A8 >  
Lesson A9 >  
Lesson A10 >  
Lesson A11 >  
Lesson A12 >  
Lesson A13 >  
Lesson A14 >  
Lesson A15 >  
Lesson A16 >  
Lesson A17 >  
Lesson A18 >  
Lesson A19 >  
Lesson A20 >  
Lesson A21 >  
Lesson A22 >  
Lesson AB23 >  
Lesson AB24 >  
Lesson AB25 >  
Lesson AB26 >  
Lesson AB27 >  
Lesson AB28 >  
Lesson AB29 >  
Lesson AB30 >  
Lesson AB31 >  
Lesson AB32 >  
Lesson AB33 >  
Vocabulary >  
 

LAB ASSIGNMENT A17.1 page 11 of 11

QuadSort

Instructions:

  1. 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 lesson provides an example of counting for the bubbleSort method.

  2. Test each sorting algorithm for the number of steps to sort 100, 200, 400 and 800 integers.

  3. Record your answers below.

  4. Recursive mergesort will be studied in Lesson A18, Merge and MergeSort.

  5. You will turn in this lab with Lab Assignment A18.2, MergeSort.
 
100 integers
200 integers
400 integers
800 integers
BubbleSort
_____________
_____________
_____________
_____________
SelectionSort
_____________
_____________
_____________
_____________
InsertionSort
_____________
_____________
_____________
_____________
MergeSort
(recursive)
_____________
_____________
_____________
_____________

 

Main Previous
Contact
 © ICT 2006, All Rights Reserved.