Algorithms Lesson 7: Analyzing Bubblesort

6:14
65,854
208
6

Description

http://xoax.net/

Lesson Page:
http://xoax.net/comp_sci/crs/algorithms/lessons/Lesson7/

For this algorithms video lesson, we perform a time-complexity analysis of the bubble sort algorithm. We use mathematical induction to prove that the algorithm has a running time of big theta of n-squared.

Please submit all questions to our forum:
http://xoax.net/forum/

Copyright 2011 XoaX.net LLC

Related Videos

Leave a Reply

Your email address will not be published. Required fields are marked *