10:35
Time complexity of merge sort
15:16
mergesort
14:28
worst case quick sort
11:46
Best case Efficiency of quick sort
22:53
quicksort
16:00
Tower of Hanoi
15:49
Mathematical Analysis of Recursive algorithm
15:19
Mathematical Analysis part 2
17:47
mathematical analysis of non recursive algorithms
23:28
graph coloring problem
13:31
subset sum problem
12:09
auto correlation test
11:49
chisquare test
28:30
Hamiltonian circuit problem
31:40
backtracking N Queens problem
38:37
travelling sales person problem
50:15
optimal binary search tree
10:40
Time series input model
36:37
multi stage graph
10:48
Multivariate input model
39:22
knapsack using memory function
36:35
knapsack using dynamic programming(0/1 knapsack)
15:01
chi square, exponential distribution
23:17
goodness of fit, chi square test using poisson distribution
14:05
floyd's algorithm
29:09
dynamic programming, warshalls
16:40
poisson process
16:59
Normal, Triangular ,Log-normal & Erlang distribution
24:53
heapsort
32:59
decrease and conquer
27:24
heap construction
17:00
strassens matrix multiplication
09:11
strassens matrix 4x4
15:57
k s test
20:24
continuous Distribution
22:19
Transform & Conquer Technique
22:11
geometric, negetive binomial, poisson distributions
14:18
Bernaulli,s trial & distribution
20:40
statistical models
16:38
huffmann trees
06:53
discrete distribution
15:36
empirical continueous distribution
13:40
weibull & triangular distribution
07:20
gamma distribution
10:05
inverse transform technique
12:48
poisson distribution
20:22
huffmann code problem
15:41
dijkstras eg2
20:53
dijkstras algorithm
12:38
kruskal's algorithm
20:49
prims algorithm
18:32
knapsack problem
15:38
job sequencing with deadline
15:21
greedy method
X
About
Tags