Red-Black Trees (Algorithms)

Cambridge Algorithms Course | Sorting, Complexity & Heaps (Full Section)

المدة

10:13:08 ساعة

اللغة

الإنجليزية

المشاهدات

126 مشاهدات

Red-Black Trees (Algorithms)

جميع الدروس

28 درس

18:45 Algorithms: longest common subsequence (dynamic programming example)

18:21 Three secrets for doing well in your university exams (Algorithms)

32:02 Priority Queues and Binomial Heaps (Algorithms)

33:24 Hash Tables (Algorithms)

38:05 B-Trees (Algorithms)

28:35 Red-Black Trees (Algorithms)

15:58 2-3-4 Trees (Algorithms)

38:50 Binary Search Trees (Algorithms)

22:50 Algorithms: list, tree, stack, queue, dictionary (elementary data structures)

20:14 Algorithms: What can the Sinclair ZX Spectrum teach you about data structures, memory and pointers?

05:12 Algorithms: algorithm design strategies

36:16 Algorithms: Huffman compression (another greedy algorithm)

27:41 Algorithms: greedy solution to hall allocation problem (cheaper!)

16:31 Algorithms: hall allocation (dynamic programming example)

20:45 Introducing Algorithms: three hard problems (Algorithms @ Cambridge)

22:55 Algorithms: find optimal order for a chain of matrix multiplications (dynamic programming example)

22:22 Algorithms: rod cutting (dynamic programming example)

11:43 Algorithms: dynamic programming introduction

04:28 Algorithms: sorting algorithms compared

21:21 Algorithms: how to sort in linear time: counting sort, bucket sort, radix sort

25:58 Algorithms: quicksort, median, order statistics, stability

19:19 Algorithms: the heap is amazing! Here is one more reason why: the asymptotic cost to build one.

17:58 Algorithms: Heapsort

23:55 Algorithms: Mergesort

10:48 Algorithms: selectsort, binary insertsort, bubblesort

17:30 Algorithms: the cost of sorting

19:04 Algorithms: asymptotic complexity, big-O notation, big-Theta, big-Omega, small-o, small-omega

22:18 Algorithms: insertsort