Emby / [Pearson] Algorithms (24-Part Series)
00001 algorithms_-_introduction
00002 dynamic_connectivity
00003 quick_find
00004 quick_union
00005 quick-union_improvements
00006 union-find_applications
00007 introduction_to_analysis_of_algorithms
00008 observations
00009 mathematical_models
00010 order-of-growth_classifications
00011 theory_of_algorithms
00012 memory
00013 stacks
00014 resizing_arrays
00015 queues
00016 generics
00017 iterators
00018 stack_and_queue_applications
00019 introduction_to_sorting
00020 selection_sort
00021 insertion_sort
00022 shellsort
00023 shuffling
00024 convex_hull
00025 mergesort
00026 bottom-up_mergesort
00027 sorting_complexity
00028 comparators
00029 stability
00030 quicksort
00031 selection
00032 duplicate_keys
00033 system_sorts
00034 apis_and_elementary_implementations
00035 binary_heaps
00036 heapsort
00037 event-driven_simulation
00038 symbol_table_apis
00039 elementary_implementations
00040 ordered_operations
00041 binary_search_trees
00042 ordered_operations_in_bsts
00043 deletion_in_bsts
00044 search_trees
00045 red-black_bsts
00046 b-trees
00047 range_search
00048 line_segment_intersection
00049 kd-trees
00050 interval_search_trees
00051 rectangle_intersection
00052 hash_functions
00053 separate_chaining
00054 linear_probing
00055 context
00056 sets
00057 dictionary_clients
00058 indexing_clients
00059 sparse_vectors
00060 introduction_to_graphs
00061 graph_api
00062 depth-first_search
00063 breadth-first_search
00064 connected_components
00065 graph_challenges - corrupted..........
00066 introduction_to_digraphs
00067 digraph_api
00068 digraph_search
00069 topological_sort
00070 strong_components
00071 introduction_to_msts
00072 greedy_algorithm
00073 edge-weighted_graph_api
00074 kruskal_s_algorithm
00075 prim_s_algorithm
00076 mst_context
00077 shortest_paths_apis
00078 shortest_path_properties
00079 dijkstra_s_algorithm
00080 edge-weighted_dags
00081 negative_weights
00082 introduction_to_maxflow
00083 ford-fulkerson_algorithm
00084 maxflow-mincut_theorem
00085 running_time_analysis
00086 java_implementation
00087 maxflow_applications
00088 strings_in_java
00089 key-indexed_counting
00090 lsd_radix_sort
00091 msd_radix_sort
00092 3-way_radix_quicksort
00093 suffix_arrays
00094 r-way_tries
00095 ternary_search_tries
00096 character-based_operations
00097 introduction_to_substring_search
00098 brute-force_substring_search
00099 knuth-morris-pratt
00100 boyer-moore
00101 rabin-karp
00102 regular_expressions
00103 res_and_nfas
00104 nfa_simulation
00105 nfa_construction
00106 regular_expression_applications
00107 introduction_to_data_compression
00108 run-length_coding
00109 huffman_compression
00110 lzw_compression
00111 introduction_to_reductions
00112 designing_algorithms
00113 establishing_lower_bounds
00114 classifying_problems
00115 brewer_s_problem
00116 simplex_algorithm
00117 simplex_implementations
00118 linear_programming_reductions
00119 introduction_to_intractability
00120 search_problems
00121 p_vs._np
00122 classifying_problems
00123 np-completeness
00124 coping_with_intractability