Lesson 4 of 10 • 21 upvotes • 13:29mins
Asymptotic Notations - big O , omega , theta notations ; mathematical analysis of non recursive functions ; practise questions
10 lessons • 1h 46m
Introduction
11:36mins
Insertion in Array , Basics of Linked List
9:24mins
Algorithms
11:24mins
Asymptotic Notations
13:29mins
Searching and Sorting
13:22mins
Stacks
11:03mins
Infix to postfix ; evaluation of postfix expressions
9:49mins
Tower Of Hanoi
6:38mins
Introduction to Data Structures (in Hindi)
10:50mins
Balancing Paranthesis
9:00mins