Home Courses Interview Preparation Course Comparison of all sorting methods (time and space complexity)

Comparison of all sorting methods (time and space complexity)

Instructor: admin Duration: 6 mins

This content is restricted. Please Login

Prev
Next
Priority queues: Application of Heaps
Sample Questions 1
1.1
What are Data Structures?
12 min
2.1
One-dimensional array
17 min
2.2
Multi-dimensional array
31 min
3.1
Symmetric matrix
12 min
3.2
Lower triangular matrix & Diagonal matrix
8 min
3.3
Tridiagonal matrix, Z-matrix, Toeplitz Matrix
7 min
4.1
Dynamic arrays & Amortized time
20 min
4.2
Where do arrays fail?
12 min
5.1
Solved Problem 1
4 min
5.2
Solved Problem 2
5 min
5.3
Solved Problem 3
3 min
5.4
Solved Problem 4
4 min
5.5
Solved Problem 5
4 min
5.6
Solved Problem 6
5 min
5.7
Solved Problem 7
5 min
5.8
Solved Problem 8
5 min
5.9
Solved Problem 9
3 min
6.1
Structure & memory organization
19 min
6.2
Code for node: (C Code)
4 min
6.3
Code for Node (Python)
4 min
6.4
Insertion: (C code)
19 min
6.5
Insertion (Python code)
18 min
6.6
Delete: (C - Code)
13 min
6.7
Delete (Python Code)
9 min
6.8
Traversal & Search
9 min
6.9
Traversal & Search (Python code)
8 min
6.10
Drawbacks
10 min
7.1
Solved Problem 1
2 min
7.2
Solved Problem 2
5 min
8.1
Introduction to Doubly Linked List
9 min
8.2
Structure & memory organization
6 min
8.3
Code for Node (Python)
3 min
8.4
Insert
13 min
8.5
Insertion (Python code)
13 min
8.6
Delete
10 min
8.7
Delete (Python Code)
13 min
8.8
Drawbacks
2 min
9.1
Introduction to Circular Linked lists
4 min
9.2
Circular Singly and Doubly Linked Lists
6 min
9.3
Circular Linked List: C-Code
2 min
9.4
Insertion (Python code)
14 min
9.5
Delete (Python Code)
9 min
10.1
Solved Problem 1
6 min
11.1
Array vs Linked Lists
3 min
12.1
Introduction to Stacks
12 min
12.2
Stack Operations: Push and Pop
5 min
12.3
How to implement a stack?
16 min
12.4
Stack Implementation [Python]
11 min
12.5
Application: Parenthesis check
20 min
12.6
Parenthesis Check [Python Code]
10 min
13.1
Infix, Prefix and Postfix
16 min
13.2
Infix to Postfix
20 min
13.3
Infix to postfix [Python Code]
21 min
13.4
Infix to Prefix
7 min
13.5
Evaluation of postfix
7 min
13.6
Evaluation of Postfix [Python code]
11 min
13.7
Evaluation of prefix
4 min
14.1
Solved Problem 1
1 min
14.2
Solved Problem 2
5 min
14.3
Solved Problem 3
4 min
14.4
Solved Problem 4
2 min
14.5
Solved Problem 5
3 min
14.6
Solved Problem 6
1 min
15.1
Motivation: Why we need them?
8 min
15.2
Operations: Enqueue and Dequeue
5 min
15.3
How to implement them?
12 min
15.4
Linear and Circular Queue implementations.
5 min
15.5
Queue : Linked list Implementation (Python Code)
12 min
15.6
Circular Queue : Linked List Implementation (python code)
14 min
16.1
Solved Problem 1
5 min
16.2
Solved Problem 2
4 min
16.3
Solved Problem 3
10 min
16.4
Solved Problem 4
4 min
16.5
Solved Problem 5
2 min
16.6
Solved Problem 6
4 min
16.7
Solved Problem 7
2 min
16.8
Solved Problem 8
7 min
16.9
Solved Problem 9
7 min
17.1
Binary Search Tree: intuition & terminology
22 min
17.2
Implementation using Pointers/References
6 min
17.3
Implementation using Arrays
13 min
17.4
Build a Binary search tree
18 min
17.5
Build Binary Search Tree [python code]
12 min
17.6
Operations: Search, Insert, Min and Max
22 min
17.7
Operations: Search, Min, max [Python Code]
12 min
17.8
Traversals: in-order & sort, pre-order, post-order
17 min
17.9
Preorder Traversal: Recursive and Iterative [Python code]
13 min
17.10
Inorder Iterative Approach [Python code]
11 min
17.11
Post Order Traversal : Recursive Approach [Python Code]
5 min
17.12
Post Order Traversal: Iterative Apparoch using 2 stacks [Python code]
14 min
17.13
Post Order Traversal: Iterative Apparoch using one stack [Python code]
18 min
17.14
Operations: Delete
12 min
17.15
Binary Search Tree: Deletion [python Code]
23 min
17.16
Randomized BST
10 min
18.1
Solved Problem 1
6 min
18.2
Solved Problem 2
10 min
18.3
Solved Problem 3
6 min
18.4
Solved Problem 4
8 min
18.5
Solved Problem 5
5 min
18.6
Solved Problem 6
2 min
18.7
Solved Problem 7
2 min
18.8
Solved Problem 8
2 min
18.9
Solved Problem 9
4 min
18.10
Solved Problem 10
2 min
18.11
Solved Problem 11
4 min
19.1
Logical structure & implementation
12 min
19.2
Terminology & Traversals
18 min
19.3
Types of Binary Trees
14 min
19.4
Properties of a Tree: Depth, Nodes, Leafs
12 min
19.5
Counter Total nodes and Leaf nodes [Python code]
10 min
19.6
Maximum Depth of Binary Tree [Python code]
13 min
19.7
Application: Backtracking for Sudoku
35 min
19.8
Application: Backtracking for Eight Queens
16 min
19.9
Applications of Trees: Hierarchical information, Websites (DOM)
10 min
20.1
Postfix to Expression Tree
13 min
20.2
Evaluating an expression Tree
10 min
20.3
Evaluating Expression Tree [Python code]
9 min
21.1
Solved Problem 1
8 min
21.2
Solved Problem 2
4 min
21.3
Solved Problem 3
5 min
21.4
Solved Problem 4
4 min
21.5
Solved Problem 5
6 min
21.6
Solved Problem 6
5 min
23.1
Sample Questions 1
2 min
23.2
Sample Questions 2
5 min
23.3
Sample Questions 3
3 min
23.4
Sample Questions 4
4 min
23.5
Sample Questions 5
3 min
23.6
Sample Questions 6
2 min
23.7
Sample Questions 7
3 min
23.8
Sample Questions 8
2 min
24.1
Solutions for Practice Test-7

60 min
25.1
AVL Trees: What and Why?
21 min
25.2
Height of an AVL Tree & Searching
18 min
25.3
Balancing Tree using Rotations: Single Rotation LL, RR
23 min
25.4
Double Rotation: RL rotation
15 min
25.5
Double Rotation: LR Rotation
9 min
25.6
Insertion with example
41 min
25.7
AVL Tree: Insertion [Python code]
35 min
25.8
AVL Tree: Delete
16 min
25.9
AVL Tree: Delete (Python)
21 min
26.1
Solved Problem 1
3 min
26.2
Solved Problem 2
2 min
26.3
Solved Problem 3
5 min
27.1
Hash-Tables: What and Why?
8 min
27.2
Direct access table
10 min
27.3
Hash Functions and collisions
8 min
27.4
Chaining & load factor
16 min
27.5
Hash Function: Division method (Modulo Hash function)
12 min
27.6
Multiplication method
11 min
27.7
Collision Resolution: Open Addressing (Closed Hashing)
13 min
27.8
Collision Resolution: Linear probing
9 min
27.9
Collision Resolution: Double Hashing
4 min
27.10
Collision Resolution: Quadratic Probing
4 min
27.11
Applications: Sparse Matrix representation.
12 min
27.12
Applications: Super Fast Search
7 min
28.1
Solved Problem 1
2 min
28.2
Solved Problem 2
5 min
28.3
Solved Problem 3
8 min
28.4
Solved Problem 4
2 min
28.5
Solved Problem 5
2 min
28.6
Solved Problem 6
3 min
28.7
Solved Problem 7
6 min
29.1
problem 1
7 min
29.2
Problem 2
4 min
29.3
Problem 3
4 min
29.4
Problem 4
9 min
29.5
Problem 5
5 min
29.6
Problem 6
8 min
29.7
Problem 7
1 min
29.8
Problem 8
1 min
29.9
Problem 9
2 min
29.10
Problem 10
4 min
29.11
Problem 11
6 min
29.12
Problem 12
4 min
29.13
Problem 13
5 min
29.14
Problem 14
6 min
29.15
Problem 15
3 min
30.1
Graphs: Why, What and Basics
32 min
30.2
Representation of Graphs: Adjacency Matrix
13 min
30.3
Represenation Graph: Adjacency Matrix [Python code]
11 min
30.4
Representation of Graphs: Adjacency Lists
12 min
30.5
Represenation Graph: Adjacency List [Python code]
10 min
30.6
Connectivity in undirected Graphs
19 min
30.7
Connectivity in Directed Graphs
15 min
30.8
Breadth First Search: Intuition and example
19 min
30.9
BFS: Color coding intuition
7 min
30.10
BFS: Code and Complexity
15 min
30.11
BFS [Python code]
16 min
30.12
BFS: Applications
10 min
30.13
Depth First Search: Intuition and code
36 min
30.14
DFS: Analysis
5 min
30.15
DFS: Edge types
11 min
30.16
DFS [Python Code]
17 min
30.17
Application of DFS: Detect cycles in a di-graph
9 min
30.18
Application: Strongly connected components
26 min
30.19
Application of DFS: Topological Sort
19 min
31.1
Solved Problems 1
5 min
31.2
Solved Problems 2
4 min
31.3
Solved Problems 3
4 min
31.4
Solved Problems 4
5 min
31.5
Solved Problems 5
5 min
31.6
Solved Problems 6
4 min
31.7
Solved Problems 7
6 min
32.1
Minimal Spanning Tree: What and Why?
19 min
32.2
Kruskal's Algorithm
24 min
32.3
Kruskal's Algorithm [Python code]
18 min
32.4
Prim's Algorithm
34 min
32.5
Properties of MST
23 min
33.1
Solved Problem 1
12 min
33.2
Solved Problem 2
5 min
33.3
Solved Problem: MST using Prim's and Kruskal's Algorithms
12 min
33.4
Solved Problem 4
8 min
33.5
Solved Problem 5
5 min
33.6
Solved Problem 6
7 min
33.7
Solved Problem 7
9 min
33.8
Solved Problem 8
5 min
34.1
Shortest paths: What and Why?
11 min
34.2
Dijikstra's Algorithm
20 min
34.3
Bellman-Ford Algorithm
20 min
34.4
Shortest Paths for DAGs
14 min
34.5
All Pairs shortest paths: Matrix Operations
31 min
34.6
Floyd-Warshall Algorithm
23 min
35.1
Solved Problems 1
2 min
35.2
Solved Problems 2
4 min
35.3
Solved Problems 3
4 min
35.4
Solved problem 4
7 min
35.5
Solved Problem 5
2 min
35.6
Solved problem 6
7 min
35.7
Solved Problem 7
6 min
35.8
Solved Problem 8
3 min
35.9
Solved Problem 9
11 min
35.10
Solved problem 10
7 min