Title: Performance: Algorithms
Course: CPS 261: Advanced Java Concepts ~ DL & MM MASTER > Section: Learning Units - Bb

Presentations and Videos

- Performance: Algorithms lecture video (Time: 25:00)
- Performance: Algorithms document

- In this lecture we introduce the concept of "big-O" notation.
- Sort algorithms are used to demonstrate the concept. We compare the algorithms: SelectionSort, QuickSort, and whatever algorithm Java uses in Collections.sort.
- In the analysis we discover that in "big-O" notation that SelectionSort goes as N*N while the other 2 sort algorithms go as N*Log(N) which is good for a sort routine. According to "big-O" notation QuickSort and the Collections.sort routine are similar, however, the Collections.sort routine is actually much faster. See the spreadsheet for the details.
- Another area that gets analyzed from a "big-O" point of view is Collections.shuffle and Collections.binarySearch.