Overview Introduction - Analysis of Algorithms, Insertion Sort, Merge sort - Asymptotic Notation | Recurrences | Substitution, Master Method - Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication- Quick sort, Randomized Algorithms
Learn more| Has discount |
 |
||
|---|---|---|---|
| Expiry period | Lifetime | ||
| Made in | English | ||
| Last updated at | Wed Dec 1969 | ||
| Level |
|
||
| Total lectures | 23 | ||
| Total quizzes | 0 | ||
| Total duration | 30:05:12 Hours | ||
| Total enrolment |
0 |
||
| Number of reviews | 0 | ||
| Avg rating |
|
||
| Short description | Overview Introduction - Analysis of Algorithms, Insertion Sort, Merge sort - Asymptotic Notation | Recurrences | Substitution, Master Method - Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication- Quick sort, Randomized Algorithms | ||
| Outcomes |
|
||
| Requirements |
|
Study any topic, anytime. explore thousands of courses for the lowest price ever!