Computer Science Illuminated

eLearning
Interactive Review

Animated Flashcards
Live Wire
Cryptic Crossword Puzzles
Ethical Issues
Biographical Sketches
Did You Know?
Goin Live
Digital Lab Manual
Online Glossary
The Learning Store
Language Library
Download PEP/7
Instructor Resources
Student Resources

eLearning Home

Complexity of Sorting Algorithms

Download the Cover Sheet for this lab as an Adobe PDF. This can be used to record your answers to the questions in the lab.

In previous exercises you have examined the efficiency of searches and sorts by looking at measures such as swaps and comparisons required in the algorithms. In Chapter 17, Big-O is described as a way to measure complexity of algorithms. In this lab assignment, you will reexamine some of the sorts you know and two you do not know using Big-O notation.

Go to each of the pages listed below and follow the directions.


BigO1

BigO2

BigO3


Merge sort seems to come out on top in all of the experiments. If this is true, why would we ever use another sort? Can you think of another measure that we are not taking into account that might make Merge Sort less attractive?

After examining the various sorting algorithms with random data and ordered data, which sorts would be appropriate under each of the following circumstances?

    • the data are already in ascending order
    • the data are already in descending order
    • the data are in random order
    • nothing is known about the data
 
Educators: More Information About This Text Other Computer Science Titles at Jones and Bartlett
Copyright 2019 Jones and Bartlett PublishersContact webmaster