Join Joe Marini for an in-depth discussion in this video Measuring algorithm performance, part of Programming Foundations: Algorithms.
- [Narrator] Because algorithms are designed…to work on sets of data and solve computational…problems it's important to understand how to talk…about algorithm performance.…This is an important factor in how you choose a…particular algorithm to solve a programming problem…as well as understanding how your program will behave…under different circumstances.…So what we want to do is measure…how does the performance of an algorithm change,…based on the size of the input set of data.…You'll often hear a term called Big-O notation…used to describe algorithm performance.…
This notation format is used to describe…how a particular algorithm performs…as the size of the set of input grows over time.…And the reason the letter O is used is…because the growth rate of an algorithm's time complexity…is also referred to as the order of operation.…It usually describes the worst case scenario of…how long it takes to perform a given operation.…And it's important to note that many…different algorithms and data structures…have more than one Big-O value.…
Author
Released
11/8/2018- Measuring algorithm performance
- Working with data structures such as arrays, stacks, and queues
- Looping and recursion
- Sorting data
- Searching data
- Filtering and value counting with hash tables
Skill Level Beginner
Duration
Views
-
Introduction
-
What you should know1m 35s
-
1. Overview
-
What are algorithms?2m 44s
-
-
2. Common Data Structures
-
Arrays2m 29s
-
Linked lists2m 36s
-
Linked lists walkthrough7m 35s
-
Stacks and queues2m 43s
-
Hash tables7m 59s
-
3. Recursion
-
Understanding recursion3m 38s
-
Simple recursion example3m 9s
-
Power and factorial4m 14s
-
-
4. Sorting Data
-
Overview of sorting2m 4s
-
The bubble sort5m 8s
-
The merge sort2m 24s
-
Implement the merge sort5m 10s
-
The quicksort3m 31s
-
Implement the quicksort5m 39s
-
-
5. Searching Data
-
Unordered list search3m 45s
-
Ordered list search5m 30s
-
-
6. Other Algorithms
-
Find max value recursively3m 44s
-
Conclusion
-
Next steps1m 18s
-
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.
CancelTake notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.
Share this video
Embed this video
Video: Measuring algorithm performance