Heap Sort : C Implementation and Analysis | CourseGalaxy

Autoplay
Autocomplete

Previous Lesson Complete and Continue

Data Structures and Algorithms In C

About Course

Data Structures and Algorithms in C (1:35)
Source Code Repository

Introduction to Data Structures and Algorithms

Introduction to Data Structures and Algorithms (3:07)
Measuring Running time of Algorithms (4:36)
Asymptotic Analysis (2:41)
Big O Notation (3:40)
Finding Big O (4:24)
Tight and Loose Upper Bounds (1:29)
Big O analysis of Algorithms (2:05)
Finding Time complexity (2:57)
Big O analysis of Algorithms: Examples (13:44)
Worst case, Best case and Average Case Analysis (7:38)
Common Complexities (3:03)
Abstract Data Types (7:16)

Linked List

Introduction (9:54)
Traversing and Searching a Single Linked List (5:17)
Finding pointers in a single linked list (5:12)
Insertion in a Single Linked List (5:14)
Insertion in a Single Linked List ..contd (7:37)
Deletion in a Single Linked List (7:52)
Reversing a Single Linked List (2:12)
Doubly linked list (6:06)
Insertion in a doubly linked List (13:08)
Deletion from doubly linked list (7:14)
Reversing a doubly linked list (2:32)
Circular linked list (2:19)
Insertion in a circular Linked List (6:26)
Deletion in a circular linked list (2:15)
Concatenation (3:03)
Linked List with Header Node (11:30)
Sorted linked list (4:31)
Merging of sorted Linked lists (9:47)
Sorting a Linked list using Bubble Sort (7:24)
Sorting a Linked list using Merge Sort (3:28)
Finding and Removing a cycle in a Linked list (19:56)

Stack and Queue

Introduction (2:09)
Stack (1:29)
Array Implementation of Stack (4:59)
Linked List Implementation of Stack (3:57)
Queue (1:13)
Array Implementation of Queue (12:48)
Linked List implementation of Queue (4:00)
Queue through Circular Linked List (4:42)
Circular Queue (15:50)
Deque (8:01)
Priority Queue (2:36)
Checking validity of an expression containing nested parentheses (11:38)
Function calls (2:16)
Evaluating Arithmetc Expressions (3:22)
Polish Notations (5:56)
Converting infix expression to postfix expression (10:31)
Evaluation of postfix expression (3:12)

Recursion

Introduction (2:38)
Flow of control in Recursive functions (2:09)
Winding and unwinding phase (1:12)
Factorial (3:33)
Printing numbers from 1 to n (4:45)
Sum of digits of an integer (2:56)
Base conversion (2:05)
Finding nth power of a number (1:38)
Euclids Algorithm (2:43)
Fibonacci Series (2:31)
Tower of Hanoi (6:44)
Tail recursion (5:20)
Recursion vs. Iteration (1:26)

Binary Tree

Intoduction to trees (6:01)
Binary Tree (6:50)
Strictly Binary Tree and Extended Binary Tree (10:30)
Full binary tree and Complete Binary Tree (4:58)
Array Representation of Binary trees (3:26)
Linked Representation of Binary Trees (4:28)
Traversal in Binary Tree (4:12)
Preorder Traversal (4:58)
Inorder Traversal (4:43)
Postorder Traversal (4:30)
Level order traversal (3:18)
Finding height of a Binary tree (3:02)
Binary Tree in C (5:10)
Constructing Binary tree from Traversals (1:35)
Constructing binary tree from inorder and preorder traversals (4:23)
Constructing binary tree from postorder and inorder traversals (3:49)

Binary Search Tree

Introduction (3:03)
Traversal in Binary Search Tree (3:48)
Searching in a Binary Search Tree (12:16)
Nodes with Minimum and Maximum key (3:23)
Insertion in a Binary Search Tree (7:40)
Deletion in a Binary Search Tree (11:48)

Heap

Introduction (2:40)
Heap Representation (2:12)
Insertion in Heap (7:24)
Deletion (7:37)
Building a heap (8:30)
Heap Applications (1:06)

Sorting

Introduction (5:02)
Sort Stability (2:25)
Selection Sort (1:49)
Selection Sort : Example (1:18)
Selection Sort in C (5:48)
Analysis of Selection Sort (2:20)
Bubble Sort (2:24)
Bubble Sort : Example (2:11)
Bubble Sort in C (4:15)
Improvement in Bubble Sort (2:16)
Analysis of Bubble Sort (2:04)
Insertion Sort (2:37)
Insertion Sort : Example (2:22)
Insertion Sort in C (3:43)
Analysis of Insertion sort (9:20)
Shell Sort (2:24)
Shell Sort : Example (2:07)
Shell Sort in C (3:24)
Analysis of Shell Sort (3:29)
Merging two Sorted Arrays (5:54)
Recursive Merge Sort (4:58)
Recursive Merge Sort in C (7:20)
Analysis of Merge Sort (1:12)
Iterative Merge Sort (3:02)
Iterative Merge Sort in C (5:30)
Quick Sort (6:56)
Quick Sort in C (6:48)
Analysis of Quick Sort (3:00)
Binary Tree Sort (3:05)
Binary Tree Sort in C (2:31)
Analysis of Binary Tree Sort (1:14)
Heap Sort (7:02)
Heap Sort : C Implementation and Analysis (1:46)
Radix Sort (8:34)
Radix Sort : C Implementation and Analysis (5:28)
Address Calculation Sort (4:50)
Address Calculation Sort in C (5:28)
Analysis of Address Calculation Sort (2:04)
Sorting Records (3:46)

Bonus Section

Bonus Lecture

Teach online with

Heap Sort : C Implementation and Analysis

Complete and Continue