Главная
Study mode:
on
1
Divide and Conquer Paradigm
2
Solving Recurrences
3
Quick Sort
4
Heap Sort
5
Insertion Sort and Asymptotic Analysis
6
Decision Tree
7
Linear Time Sorting
8
Order Statistics
9
Hashing
10
Universal Hashing, BST Sort
11
Red-Black Tree
12
Augmenting Data Structure
13
Computational Geometry
14
Van Emde Boas Data Structure
15
Dynamic Programming
16
Graph Algorithm
17
BFS and DFS
18
Dijkstra
19
Bellman Ford
20
Floyd Marshall
Description:
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures  and analysis techniques for these problems.

Fundamental Algorithms - Design and Analysis

NPTEL
Add to list
0:00 / 0:00