Have any question ?
+91 8080-806-983
interviewprep@appliedroots.com
Register
Login
COURSES
C Programming
Interview Preparation Course
CRT Program
Diploma in AI and ML
Courses
C Programming
Interview Preparation Course
Success Stories
Forum
FAQ'S
Team
Contact Us
Home
Courses
Interview Preparation Course
Why does asymptotic analysis matter in the real world?
Why does asymptotic analysis matter in the real world?
Instructor:
admin
Duration:
16 mins
Full Screen
Close
Prev
Next
Order of common functions & real world applications.
Solved Problem: Polynomials
7 Comment(s)
Login to comment
Sorting & Searching : why bother with these simple tasks?
1.1
Sorting & Searching : why bother with these simple tasks?
17 min
Insertion Sort
2.1
Satellite data and key
11 min
2.2
How it works: Card-sorting
20 min
2.3
Pseudo code
24 min
2.4
Insertion sort Python Code
7 min
2.5
Correctness
6 min
2.6
In-place sorting
8 min
2.7
Stable sort
15 min
2.8
Online sorting
10 min
Analyzing an algorithm.
3.1
Model of computation
17 min
3.2
Space and time analysis of Insertion Sort-1
7 min
3.3
Space and time analysis of Insertion Sort-2
22 min
Big O, Theta, Omega notation
4.1
Insertion sort: Big O-notation
15 min
4.2
Notations: Big O
15 min
4.3
Notations: Big Omega, Theta
9 min
4.4
Notations: Small O, Omega, Theta
24 min
4.5
Relationships between various notations
21 min
4.6
Order of common functions & real world applications.
26 min
4.7
Why does asymptotic analysis matter in the real world?
16 min
Solved Problems: Big O, Theta, Omega notation.
5.1
Solved Problem: Polynomials
18 min
5.2
Solved Problem: n>n0 case
5 min
5.3
Solved Problem:1
6 min
5.4
Solved Problem2
10 min
5.5
Solved Problem 3
12 min
5.6
Solved Problem 4
9 min
5.7
Solved Problem 5
5 min
5.8
Solved Problem 6
5 min
5.9
Solved Problem 7
6 min
Merge Sort
6.1
Why learn another sorting algorithm?
6 min
6.2
How it works: Intuition
17 min
6.3
Pseudo Code
19 min
6.4
Merge Sort Python Code
13 min
6.5
Merge sort: Analysing time & space complexity
21 min
6.6
Recursion tree method: intuition
13 min
6.7
External Merge-Sort
25 min
Solved Problems of Merge sort
7.1
Solved Problem 1
5 min
7.2
Solved problem 2
4 min
7.3
Solved Problem 3
5 min
Bubble Sort
8.1
How it works: intuition + code
22 min
8.2
Bubble Sort Python code
7 min
8.3
Space and time complexity
9 min
8.4
When to use Bubble sort?
5 min
Quick Sort
9.1
Why do we need another sorting algorithm?
5 min
9.2
How it works: intuition
13 min
9.3
Partitioning
15 min
9.4
Quick sort by recursion
10 min
9.5
Time complexity: Best and Worst cases.
16 min
9.6
Quick Sort Python Code
12 min
9.7
Randomized quicksort and amortized analysis
8 min
Sample Questions on Quicksort
10.1
Solved Problem 1
3 min
10.2
Solved Problem 2
3 min
10.3
Solved Problem 3
4 min
10.4
Solved Problem 4
2 min
10.5
Solved Problem 5
2 min
10.6
Solved Problem 6
3 min
10.7
Solved Problem 7
3 min
Selection Sort
11.1
How it works: intuition + code
11 min
11.2
Selection Sort Python Code
7 min
11.3
Space and time complexity.
7 min
11.4
When to use Selection sort?
4 min
Solved Problems of Selection sort
12.1
Sample Problem 1
1 min
12.2
Sample Problem 2
1 min
12.3
Sample Problem 3
1 min
12.4
Sample Problem 4
1 min
Linear Time Sorting
13.1
Lower bounds on worst case of comparison sorting
30 min
13.2
Counting sort: intuition + code
19 min
13.3
Counting sort Python code
15 min
13.4
Space and time complexity
4 min
13.5
Radix Sort
6 min
13.6
Radix sort Python Code
15 min
13.7
Where to use which sorting algorithm?
8 min
Solved Problems of Linear time sorting
14.1
Solved Problem 1
6 min
Close