Home Courses CRT Program Pseudo code

Pseudo code

Instructor: admin Duration: 24 mins

Refer: https://en.wikipedia.org/wiki/Introduction_to_Algorithms

C code Refer: https://onlinegdb.com/BJEcW1R34

Python Code Refer: https://onlinegdb.com/S1-U71ChN

Prev
Next
How it works: Card-sorting
Correctness

0 Comment(s)

Login to comment
1.1
Why study DS and Algorithms?

20 min
2.1
What are Data Structures?

12 min
3.1
One-dimensional array
17 min
3.2
Multi-dimensional array
31 min
4.1
Structure & memory organization
19 min
4.2
Code for node
4 min
4.3
Insertion
19 min
4.4
Deletion
13 min
4.5
Array vs Linked Lists
3 min
5.1
Introduction to Stacks
12 min
5.2
Stack Operations: Push and Pop
5 min
6.1
Motivation: Why we need them?
8 min
6.2
Operations: Enqueue and Dequeue
5 min
7.1
Logical structure & implementation
12 min
7.2
Terminology & Traversals
18 min
9.1
Model of computation

17 min
9.2
Space and time analysis of Insertion Sort-1

7 min
9.3
Space and time analysis of Insertion Sort-2

22 min
10.1
Insertion sort: Big O-notation

15 min
10.2
Notations: Big O

15 min
10.3
Notations: Big Omega, Theta

9 min
10.4
Notations: Small O, Omega, Theta

24 min
10.5
Relationships between various notations

21 min
10.6
Order of common functions & real world applications.

26 min
10.7
Why does asymptotic analysis matter in the real world?

16 min
11.1
Why learn another sorting algorithm?

6 min
11.2
How it works: Intuition

17 min
11.3
Pseudo Code

19 min
11.4
Merge sort: Analysing time & space complexity

21 min
11.5
Recursion tree method: intuition

13 min
11.6
External Merge-Sort

25 min