-
SECTION 1: DATA STRUCTURE AND ALGORITHM 3
-
Philosophy of Data StructuresLecture1.1
-
Abstract Data Types and Data StructuresLecture1.2
-
Problems, Algorithms and ProgramsLecture1.3
-
-
SECTION 2: MATHEMATICAL PRELIMINARIES 5
-
Sets and RelationsLecture2.1
-
Logarithms and RecursionLecture2.2
-
Summations and RecurrencesLecture2.3
-
Mathematical Proof TechniquesLecture2.4
-
EstimatingLecture2.5
-
-
SECTION 3: ALGORITHM ANALYSIS 5
-
Faster Computer or Faster AlgorithmLecture3.1
-
Asymptotic AnalysisLecture3.2
-
Running Time of a ProgramLecture3.3
-
Multiple ParametersLecture3.4
-
Space BoundsLecture3.5
-
-
SECTION 4: LISTS, STACKS, AND QUEUES 4
-
ListsLecture4.1
-
Abstract Data Types (ADT)Lecture4.2
-
StacksLecture4.3
-
QueuesLecture4.4
-
-
SECTION 5: BINARY TREES 6
-
Definitions and PropertiesLecture5.1
-
Binary Tree TraversalsLecture5.2
-
Binary Tree Node ImplementationsLecture5.3
-
Binary Search TreesLecture5.4
-
Heaps and Priority QueuesLecture5.5
-
Huffman Coding TreesLecture5.6
-
-
SECTION 6: NON-BINARY TREES 3
-
Sorting Terminology and NotationLecture6.1
-
Three…Q(n^2) Sorting AlgorithmsLecture6.2
-
Bubble Sort, Insertion Sort , Selection SortLecture6.3
-
-
SECTION 7: INTERNAL SORTING 3
-
Quicksort, Mergesort, Heapsort, and Radix SortLecture7.1
-
Empirical Comparison of Sorting AlgorithmsLecture7.2
-
Lower Bounds for SortingLecture7.3
-
This content is protected, please login and enroll course to view this content!
Empirical Comparison of Sorting Algorithms
Prev