Lesson Plan


This lesson explains the different types of sorting algorithms and how to differentiate them on the basis of time complexity, running time, space consumption, etc. Students can easily remember and memorize these things using the notes file attached inside this lesson.


  • Career & Technical Education > General
  • Mathematics > General
  • Science > General

Education Levels:

  • Grade 11
  • Grade 12
  • Higher Education
  • Graduate
  • Undergraduate-Upper Division
  • Undergraduate-Lower Division





Access Privileges:

Public - Available to anyone

License Deed:

Creative Commons Attribution 3.0


This resource has not yet been aligned.
Curriki Rating
On a scale of 0 to 3
On a scale of 0 to 3

This resource was reviewed using the Curriki Review rubric and received an overall Curriki Review System rating of 2, as of 2009-08-05.

Component Ratings:

Technical Completeness: 3
Content Accuracy: 2
Appropriate Pedagogy: 2

Reviewer Comments:

This resource is for computer science students or students who are interested in computer programming. It primarily “walks” a student through the process of running a sorting program. The content is good and provides real-world examples that convey content to students. However, more graphical organizers like a tree table or a couple of more flow charts would be beneficial when provided by the teacher. The resource is easily found in the file folder.
Mohamed Younus H
September 22, 2012

The explanations given are really good and very useful. And we want explanations about BUBBLE SORT also..!!


Non-profit Tax ID # 203478467