DiscoverProgramming Abstractions16. Programming Abstractions Lecture 16
16. Programming Abstractions Lecture 16

16. Programming Abstractions Lecture 16

Update: 2008-07-23
Share

Description

Julie continues with sorting, specifically quadratic and linearithmic sorting methods, and then explains how to reasonably partition data sets for quicksort. Thereafter, she proceeds to go over different functional templates for sorting algorithms.
Comments 
00:00
00:00
1.0x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

16. Programming Abstractions Lecture 16

16. Programming Abstractions Lecture 16

Julie Zelenski