Internet Archive's in-browser video player requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see your browser settings for this feature.

[Coursera] Algorithms: Design and Analysis, Part 1 (Stanford University) (algo)

by: Stanford University

Publisher: Academic Torrents

Contributor: Academic Torrents

Academictorrents_collection: joes-recommended-mirror-list
video-lectures

Addeddate: 2018-08-12 18:03:22

External-identifier: urn:academictorrents:7bfcfbaf2c53588b23ba1ebccae47a2b9c5197b7

Identifier: academictorrents_7bfcfbaf2c53588b23ba1ebccae47a2b9c5197b7

Ocr: ABBYY FineReader 11.0 (Extended OCR)

Ppi: 600

Scanner: Internet Archive Python library 1.8.1

Source: http://academictorrents.com/details/7bfcfbaf2c53588b23ba1ebccae47a2b9c5197b7
torrent:urn:sha1:7bfcfbaf2c53588b23ba1ebccae47a2b9c5197b7

plus-circle Add Review

comment
Reviews

There are no reviews yet. Be the first one to write a review.

14,414 Views

4 Favorites

DOWNLOAD OPTIONS

160 files

ABBYY GZ

BACK

26.2K

01_Why_Study_Algorithms__4_min_0_PDF_abbyy.gz

26.0K

01_Why_Study_Algorithms__4_min_abbyy.gz

16.8K

02_Integer_Multiplication_9_min_0_PDF_abbyy.gz

15.5K

02_Integer_Multiplication_9_min_abbyy.gz

23.7K

03_Karatsuba_Multiplication_13_min_0_PDF_abbyy.gz

21.7K

03_Karatsuba_Multiplication_13_min_abbyy.gz

81.8K

04_About_the_Course_17_min_0_PDF_abbyy.gz

84.3K

04_About_the_Course_17_min_abbyy.gz

14.4K

05_Merge_Sort-_Motivation_and_Example_9_min_0_PDF_abbyy.gz

15.2K

05_Merge_Sort-_Motivation_and_Example_9_min_abbyy.gz

35.3K

06_Merge_Sort-_Pseudocode_13_min_0_PDF_abbyy.gz

23.8K

06_Merge_Sort-_Pseudocode_13_min_abbyy.gz

24.8K

07_Merge_Sort-_Analysis_9_min_0_PDF_abbyy.gz

29.0K

07_Merge_Sort-_Analysis_9_min_abbyy.gz

31.5K

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_0_PDF_abbyy.gz

25.0K

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_abbyy.gz

39.7K

01_The_Gist_14_min_0_PDF_abbyy.gz

33.3K

01_The_Gist_14_min_abbyy.gz

13.6K

02_Big-Oh_Notation_4_min_0_PDF_abbyy.gz

13.1K

02_Big-Oh_Notation_4_min_abbyy.gz

15.0K

03_Basic_Examples_7_min_0_PDF_abbyy.gz

15.6K

03_Basic_Examples_7_min_abbyy.gz

23.9K

04_Big_Omega_and_Theta_7_min_0_PDF_abbyy.gz

27.8K

04_Big_Omega_and_Theta_7_min_abbyy.gz

18.9K

05_Additional_Examples_Review_-_Optional_8_min_0_PDF_abbyy.gz

20.6K

05_Additional_Examples_Review_-_Optional_8_min_abbyy.gz

29.6K

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_0_PDF_abbyy.gz

25.7K

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_abbyy.gz

50.7K

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_0_PDF_abbyy.gz

44.2K

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_abbyy.gz

31.3K

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_0_PDF_abbyy.gz

37.4K

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_abbyy.gz

53.6K

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_0_PDF_abbyy.gz

57.1K

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_abbyy.gz

31.7K

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_0_PDF_abbyy.gz

32.9K

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_abbyy.gz

34.2K

01_Motivation_8_min_0_PDF_abbyy.gz

28.4K

01_Motivation_8_min_abbyy.gz

18.7K

02_Formal_Statement_10_min_0_PDF_abbyy.gz

15.2K

02_Formal_Statement_10_min_abbyy.gz

26.0K

03_Examples_13_min_0_PDF_abbyy.gz

27.9K

03_Examples_13_min_abbyy.gz

26.1K

04_Proof_I_10_min_0_PDF_abbyy.gz

22.3K

04_Proof_I_10_min_abbyy.gz

20.9K

05_Interpretation_of_the_3_Cases_11_min_0_PDF_abbyy.gz

19.1K

05_Interpretation_of_the_3_Cases_11_min_abbyy.gz

34.6K

06_Proof_II_16_min_0_PDF_abbyy.gz

38.8K

06_Proof_II_16_min_abbyy.gz

33.1K

01_Quicksort-_Overview_12_min_0_PDF_abbyy.gz

30.0K

01_Quicksort-_Overview_12_min_abbyy.gz

51.4K

02_Partitioning_Around_a_Pivot_25_min_0_PDF_abbyy.gz

56.8K

02_Partitioning_Around_a_Pivot_25_min_abbyy.gz

26.3K

03_Correctness_of_Quicksort_Review_-_Optional_11_min_0_PDF_abbyy.gz

26.9K

03_Correctness_of_Quicksort_Review_-_Optional_11_min_abbyy.gz

36.3K

04_Choosing_a_Good_Pivot_22min_0_PDF_abbyy.gz

40.6K

04_Choosing_a_Good_Pivot_22min_abbyy.gz

45.3K

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_0_PDF_abbyy.gz

48.0K

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_abbyy.gz

29.0K

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_0_PDF_abbyy.gz

33.0K

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_abbyy.gz

20.6K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_0_PDF_abbyy.gz

23.0K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_1_TYPED_abbyy.gz

104.7K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_abbyy.gz

67.6K

01_Part_I_Review_-_Optional_25_min_0_PDF_abbyy.gz

71.7K

01_Part_I_Review_-_Optional_25_min_abbyy.gz

38.3K

02_Part_II_Review_-_Optional_17_min_0_PDF_abbyy.gz

40.6K

02_Part_II_Review_-_Optional_17_min_abbyy.gz

64.8K

01_Randomized_Selection_-_Algorithm_22_min_0_PDF_abbyy.gz

60.0K

01_Randomized_Selection_-_Algorithm_22_min_abbyy.gz

41.1K

02_Randomized_Selection_-__Analysis_21_min_0_PDF_abbyy.gz

41.2K

02_Randomized_Selection_-__Analysis_21_min_abbyy.gz

86.1K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_0_PDF_abbyy.gz

39.3K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_1_TYPED_abbyy.gz

175.1K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_abbyy.gz

86.1K

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_0_PDF_abbyy.gz

47.5K

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_abbyy.gz

99.5K

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_0_PDF_abbyy.gz

24.9K

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_abbyy.gz

25.7K

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_0_PDF_abbyy.gz

23.0K

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_abbyy.gz

31.9K

01_Graphs_and_Minimum_Cuts_16_min_0_PDF_abbyy.gz

30.3K

01_Graphs_and_Minimum_Cuts_16_min_abbyy.gz

41.9K

02_Graph_Representations_14_min_0_PDF_abbyy.gz

39.8K

02_Graph_Representations_14_min_abbyy.gz

16.1K

03_Random_Contraction_Algorithm_9_min_0_PDF_abbyy.gz

16.9K

03_Random_Contraction_Algorithm_9_min_abbyy.gz

55.5K

04_Analysis_of_Contraction_Algorithm_30_min_0_PDF_abbyy.gz

65.7K

04_Analysis_of_Contraction_Algorithm_30_min_abbyy.gz

19.2K

05_Counting_Minimum_Cuts_7_min_0_PDF_abbyy.gz

18.8K

05_Counting_Minimum_Cuts_7_min_abbyy.gz

34.2K

01_Graph_Search_-_Overview_23_min_0_PDF_abbyy.gz

33.0K

01_Graph_Search_-_Overview_23_min_abbyy.gz

42.0K

02_Breadth-First_Search_BFS-_The_Basics_14_min_0_PDF_abbyy.gz

38.4K

02_Breadth-First_Search_BFS-_The_Basics_14_min_abbyy.gz

42.0K

03_BFS_and_Shortest_Paths_8_min_0_PDF_abbyy.gz

38.4K

03_BFS_and_Shortest_Paths_8_min_abbyy.gz

42.0K

04_BFS_and_Undirected_Connectivity_13_min_0_PDF_abbyy.gz

38.4K

04_BFS_and_Undirected_Connectivity_13_min_abbyy.gz

55.3K

05_Depth-First_Search_DFS-_The_Basics_7_min_0_PDF_abbyy.gz

48.5K

05_Depth-First_Search_DFS-_The_Basics_7_min_abbyy.gz

55.3K

06_Topological_Sort_22_min_0_PDF_abbyy.gz

48.4K

06_Topological_Sort_22_min_abbyy.gz

43.2K

07_Computing_Strong_Components-_The_Algorithm_29_min_0_PDF_abbyy.gz

32.1K

07_Computing_Strong_Components-_The_Algorithm_29_min_1_TYPED_abbyy.gz

138.9K

07_Computing_Strong_Components-_The_Algorithm_29_min_abbyy.gz

42.1K

08_Computing_Strong_Components-_The_Analysis_26_min_0_PDF_abbyy.gz

43.1K

08_Computing_Strong_Components-_The_Analysis_26_min_abbyy.gz

23.7K

09_Structure_of_the_Web_Optional_19_min_0_PDF_abbyy.gz

19.0K

09_Structure_of_the_Web_Optional_19_min_abbyy.gz

37.0K

01_Dijkstras_Shortest-Path_Algorithm_21_min_0_PDF_abbyy.gz

37.1K

01_Dijkstras_Shortest-Path_Algorithm_21_min_abbyy.gz

37.0K

02_Dijkstras_Algorithm-_Examples_13_min_0_PDF_abbyy.gz

37.0K

02_Dijkstras_Algorithm-_Examples_13_min_abbyy.gz

38.6K

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_0_PDF_abbyy.gz

45.1K

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_abbyy.gz

53.2K

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_0_PDF_abbyy.gz

58.8K

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_abbyy.gz

13.9K

01_Data_Structures-_Overview_5_min_0_PDF_abbyy.gz

12.5K

01_Data_Structures-_Overview_5_min_abbyy.gz

35.5K

02_Heaps-_Operations_and_Applications_18_min_0_PDF_abbyy.gz

36.1K

02_Heaps-_Operations_and_Applications_18_min_abbyy.gz

36.6K

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_0_PDF_abbyy.gz

32.6K

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_abbyy.gz

19.2K

01_Balanced_Search_Trees-_Operations_and_Applications_11_min_0_PDF_abbyy.gz

17.8K

01_Balanced_Search_Trees-_Operations_and_Applications_11_min_abbyy.gz

80.2K

02_Binary_Search_Tree_Basics_Part_I_13_min_0_PDF_abbyy.gz

72.9K

02_Binary_Search_Tree_Basics_Part_I_13_min_abbyy.gz

80.2K

03_Binary_Search_Tree_Basics_Part_II_30_min_0_PDF_abbyy.gz

72.9K

03_Binary_Search_Tree_Basics_Part_II_30_min_abbyy.gz

37.1K

04_Red-Black_Trees_21_min_0_PDF_abbyy.gz

38.1K

04_Red-Black_Trees_21_min_abbyy.gz

9.3K

05_Rotations_Advanced_-_Optional_8_min_0_PDF_abbyy.gz

8.2K

05_Rotations_Advanced_-_Optional_8_min_abbyy.gz

25.2K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_0_PDF_abbyy.gz

17.3K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_abbyy.gz

32.5K

01_Hash_Tables-_Operations_and_Applications_19_min_0_PDF_abbyy.gz

28.8K

01_Hash_Tables-_Operations_and_Applications_19_min_abbyy.gz

60.4K

02_Hash_Tables-_Implementation_Details_Part_I_19_min_0_PDF_abbyy.gz

58.2K

02_Hash_Tables-_Implementation_Details_Part_I_19_min_abbyy.gz

60.5K

03_Hash_Tables-_Implementation_Details_Part_II_22_min_0_PDF_abbyy.gz

58.3K

03_Hash_Tables-_Implementation_Details_Part_II_22_min_abbyy.gz

63.6K

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_0_PDF_abbyy.gz

53.5K

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_abbyy.gz

44.6K

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_0_PDf_abbyy.gz

52.1K

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_abbyy.gz

58.8K

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_0_PDF_abbyy.gz

60.2K

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_abbyy.gz

37.1K

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_0_PDF_abbyy.gz

31.2K

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_abbyy.gz

47.4K

01_Bloom_Filters-_The_Basics_16_min_0_PDF_abbyy.gz

49.0K

01_Bloom_Filters-_The_Basics_16_min_abbyy.gz

47.4K

02_Bloom_Filters-_Heuristic_Analysis_13_min_0_PDF_abbyy.gz

49.0K

02_Bloom_Filters-_Heuristic_Analysis_13_min_abbyy.gz

22.5K

01_Application-_Internet_Routing_Optional_11_min_abbyy.gz

34.6K

02_Application-_Sequence_Alignment_Optional_9_min_abbyy.gz

32.0K

03_Introduction_to_Greedy_Algorithms_Optional_13_min_abbyy.gz

31.6K

04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min_abbyy.gz

33.1K

05_Principles_of_Dynamic_Programming_Optional_8_min_abbyy.gz

16.5K

06_The_P_vs._NP_Question_Optional_9_min_abbyy.gz

17.5K

07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min_abbyy.gz

160 files

FULL TEXT

BACK

1.8K

01_Why_Study_Algorithms__4_min_0_PDF_djvu.txt

1.8K

01_Why_Study_Algorithms__4_min_djvu.txt

733.0B

02_Integer_Multiplication_9_min_0_PDF_djvu.txt

752.0B

02_Integer_Multiplication_9_min_djvu.txt

954.0B

03_Karatsuba_Multiplication_13_min_0_PDF_djvu.txt

1.0K

03_Karatsuba_Multiplication_13_min_djvu.txt

6.2K

04_About_the_Course_17_min_0_PDF_djvu.txt

6.2K

04_About_the_Course_17_min_djvu.txt

599.0B

05_Merge_Sort-_Motivation_and_Example_9_min_0_PDF_djvu.txt

676.0B

05_Merge_Sort-_Motivation_and_Example_9_min_djvu.txt

1.5K

06_Merge_Sort-_Pseudocode_13_min_0_PDF_djvu.txt

1.3K

06_Merge_Sort-_Pseudocode_13_min_djvu.txt

1.3K

07_Merge_Sort-_Analysis_9_min_0_PDF_djvu.txt

1.5K

07_Merge_Sort-_Analysis_9_min_djvu.txt

1.3K

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_0_PDF_djvu.txt

1.4K

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_djvu.txt

1.6K

01_The_Gist_14_min_0_PDF_djvu.txt

2.0K

01_The_Gist_14_min_djvu.txt

526.0B

02_Big-Oh_Notation_4_min_0_PDF_djvu.txt

654.0B

02_Big-Oh_Notation_4_min_djvu.txt

683.0B

03_Basic_Examples_7_min_0_PDF_djvu.txt

739.0B

03_Basic_Examples_7_min_djvu.txt

1.1K

04_Big_Omega_and_Theta_7_min_0_PDF_djvu.txt

1.4K

04_Big_Omega_and_Theta_7_min_djvu.txt

774.0B

05_Additional_Examples_Review_-_Optional_8_min_0_PDF_djvu.txt

1.0K

05_Additional_Examples_Review_-_Optional_8_min_djvu.txt

1.2K

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_0_PDF_djvu.txt

1.3K

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_djvu.txt

2.3K

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_0_PDF_djvu.txt

2.5K

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_djvu.txt

1.3K

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_0_PDF_djvu.txt

1.7K

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_djvu.txt

2.2K

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_0_PDF_djvu.txt

3.2K

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_djvu.txt

1.3K

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_0_PDF_djvu.txt

1.7K

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_djvu.txt

1.4K

01_Motivation_8_min_0_PDF_djvu.txt

1.6K

01_Motivation_8_min_djvu.txt

768.0B

02_Formal_Statement_10_min_0_PDF_djvu.txt

778.0B

02_Formal_Statement_10_min_djvu.txt

1.1K

03_Examples_13_min_0_PDF_djvu.txt

1.5K

03_Examples_13_min_djvu.txt

1.1K

04_Proof_I_10_min_0_PDF_djvu.txt

1.1K

04_Proof_I_10_min_djvu.txt

1.1K

05_Interpretation_of_the_3_Cases_11_min_0_PDF_djvu.txt

1.1K

05_Interpretation_of_the_3_Cases_11_min_djvu.txt

1.5K

06_Proof_II_16_min_0_PDF_djvu.txt

1.8K

06_Proof_II_16_min_djvu.txt

1.5K

01_Quicksort-_Overview_12_min_0_PDF_djvu.txt

1.6K

01_Quicksort-_Overview_12_min_djvu.txt

1.8K

02_Partitioning_Around_a_Pivot_25_min_0_PDF_djvu.txt

2.6K

02_Partitioning_Around_a_Pivot_25_min_djvu.txt

1.1K

03_Correctness_of_Quicksort_Review_-_Optional_11_min_0_PDF_djvu.txt

1.4K

03_Correctness_of_Quicksort_Review_-_Optional_11_min_djvu.txt

1.6K

04_Choosing_a_Good_Pivot_22min_0_PDF_djvu.txt

2.2K

04_Choosing_a_Good_Pivot_22min_djvu.txt

1.9K

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_0_PDF_djvu.txt

2.6K

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_djvu.txt

1.2K

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_0_PDF_djvu.txt

1.8K

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_djvu.txt

754.0B

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_0_PDF_djvu.txt

1.0K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_1_TYPED_djvu.txt

7.5K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_djvu.txt

3.1K

01_Part_I_Review_-_Optional_25_min_0_PDF_djvu.txt

3.9K

01_Part_I_Review_-_Optional_25_min_djvu.txt

1.6K

02_Part_II_Review_-_Optional_17_min_0_PDF_djvu.txt

2.2K

02_Part_II_Review_-_Optional_17_min_djvu.txt

3.0K

01_Randomized_Selection_-_Algorithm_22_min_0_PDF_djvu.txt

3.3K

01_Randomized_Selection_-_Algorithm_22_min_djvu.txt

1.7K

02_Randomized_Selection_-__Analysis_21_min_0_PDF_djvu.txt

2.1K

02_Randomized_Selection_-__Analysis_21_min_djvu.txt

4.0K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_0_PDF_djvu.txt

2.1K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_1_TYPED_djvu.txt

13.0K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_djvu.txt

4.0K

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_0_PDF_djvu.txt

2.4K

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_djvu.txt

4.5K

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_0_PDF_djvu.txt

1.3K

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_djvu.txt

1.1K

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_0_PDF_djvu.txt

1.3K

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_djvu.txt

1.4K

01_Graphs_and_Minimum_Cuts_16_min_0_PDF_djvu.txt

1.6K

01_Graphs_and_Minimum_Cuts_16_min_djvu.txt

1.9K

02_Graph_Representations_14_min_0_PDF_djvu.txt

2.1K

02_Graph_Representations_14_min_djvu.txt

658.0B

03_Random_Contraction_Algorithm_9_min_0_PDF_djvu.txt

825.0B

03_Random_Contraction_Algorithm_9_min_djvu.txt

2.3K

04_Analysis_of_Contraction_Algorithm_30_min_0_PDF_djvu.txt

3.2K

04_Analysis_of_Contraction_Algorithm_30_min_djvu.txt

750.0B

05_Counting_Minimum_Cuts_7_min_0_PDF_djvu.txt

963.0B

05_Counting_Minimum_Cuts_7_min_djvu.txt

1.5K

01_Graph_Search_-_Overview_23_min_0_PDF_djvu.txt

1.9K

01_Graph_Search_-_Overview_23_min_djvu.txt

1.7K

02_Breadth-First_Search_BFS-_The_Basics_14_min_0_PDF_djvu.txt

2.2K

02_Breadth-First_Search_BFS-_The_Basics_14_min_djvu.txt

1.7K

03_BFS_and_Shortest_Paths_8_min_0_PDF_djvu.txt

2.2K

03_BFS_and_Shortest_Paths_8_min_djvu.txt

1.7K

04_BFS_and_Undirected_Connectivity_13_min_0_PDF_djvu.txt

2.2K

04_BFS_and_Undirected_Connectivity_13_min_djvu.txt

2.3K

05_Depth-First_Search_DFS-_The_Basics_7_min_0_PDF_djvu.txt

2.8K

05_Depth-First_Search_DFS-_The_Basics_7_min_djvu.txt

2.3K

06_Topological_Sort_22_min_0_PDF_djvu.txt

2.8K

06_Topological_Sort_22_min_djvu.txt

2.0K

07_Computing_Strong_Components-_The_Algorithm_29_min_0_PDF_djvu.txt

1.8K

07_Computing_Strong_Components-_The_Algorithm_29_min_1_TYPED_djvu.txt

9.7K

07_Computing_Strong_Components-_The_Algorithm_29_min_djvu.txt

1.7K

08_Computing_Strong_Components-_The_Analysis_26_min_0_PDF_djvu.txt

2.1K

08_Computing_Strong_Components-_The_Analysis_26_min_djvu.txt

1,006.0B

09_Structure_of_the_Web_Optional_19_min_0_PDF_djvu.txt

1.1K

09_Structure_of_the_Web_Optional_19_min_djvu.txt

1.5K

01_Dijkstras_Shortest-Path_Algorithm_21_min_0_PDF_djvu.txt

2.0K

01_Dijkstras_Shortest-Path_Algorithm_21_min_djvu.txt

1.5K

02_Dijkstras_Algorithm-_Examples_13_min_0_PDF_djvu.txt

2.0K

02_Dijkstras_Algorithm-_Examples_13_min_djvu.txt

1.5K

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_0_PDF_djvu.txt

2.2K

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_djvu.txt

2.3K

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_0_PDF_djvu.txt

3.0K

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_djvu.txt

563.0B

01_Data_Structures-_Overview_5_min_0_PDF_djvu.txt

710.0B

01_Data_Structures-_Overview_5_min_djvu.txt

1.5K

02_Heaps-_Operations_and_Applications_18_min_0_PDF_djvu.txt

2.0K

02_Heaps-_Operations_and_Applications_18_min_djvu.txt

1.4K

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_0_PDF_djvu.txt

1.7K

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_djvu.txt

791.0B

01_Balanced_Search_Trees-_Operations_and_Applications_11_min_0_PDF_djvu.txt

970.0B

01_Balanced_Search_Trees-_Operations_and_Applications_11_min_djvu.txt

3.4K

02_Binary_Search_Tree_Basics_Part_I_13_min_0_PDF_djvu.txt

4.3K

02_Binary_Search_Tree_Basics_Part_I_13_min_djvu.txt

3.4K

03_Binary_Search_Tree_Basics_Part_II_30_min_0_PDF_djvu.txt

4.3K

03_Binary_Search_Tree_Basics_Part_II_30_min_djvu.txt

1.6K

04_Red-Black_Trees_21_min_0_PDF_djvu.txt

2.2K

04_Red-Black_Trees_21_min_djvu.txt

327.0B

05_Rotations_Advanced_-_Optional_8_min_0_PDF_djvu.txt

442.0B

05_Rotations_Advanced_-_Optional_8_min_djvu.txt

1.0K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_0_PDF_djvu.txt

1.1K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_djvu.txt

1.4K

01_Hash_Tables-_Operations_and_Applications_19_min_0_PDF_djvu.txt

1.7K

01_Hash_Tables-_Operations_and_Applications_19_min_djvu.txt

2.6K

02_Hash_Tables-_Implementation_Details_Part_I_19_min_0_PDF_djvu.txt

3.4K

02_Hash_Tables-_Implementation_Details_Part_I_19_min_djvu.txt

2.6K

03_Hash_Tables-_Implementation_Details_Part_II_22_min_0_PDF_djvu.txt

3.4K

03_Hash_Tables-_Implementation_Details_Part_II_22_min_djvu.txt

2.8K

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_0_PDF_djvu.txt

3.4K

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_djvu.txt

1.9K

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_0_PDf_djvu.txt

2.8K

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_djvu.txt

2.5K

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_0_PDF_djvu.txt

3.4K

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_djvu.txt

1.6K

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_0_PDF_djvu.txt

1.8K

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_djvu.txt

2.1K

01_Bloom_Filters-_The_Basics_16_min_0_PDF_djvu.txt

2.7K

01_Bloom_Filters-_The_Basics_16_min_djvu.txt

2.1K

02_Bloom_Filters-_Heuristic_Analysis_13_min_0_PDF_djvu.txt

2.7K

02_Bloom_Filters-_Heuristic_Analysis_13_min_djvu.txt

845.0B

01_Application-_Internet_Routing_Optional_11_min_djvu.txt

1.4K

02_Application-_Sequence_Alignment_Optional_9_min_djvu.txt

1.3K

03_Introduction_to_Greedy_Algorithms_Optional_13_min_djvu.txt

1.3K

04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min_djvu.txt

2.0K

05_Principles_of_Dynamic_Programming_Optional_8_min_djvu.txt

625.0B

06_The_P_vs._NP_Question_Optional_9_min_djvu.txt

672.0B

07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min_djvu.txt

30 files

HTML

BACK

35.4K

CourseLogistics.html

59.5K

DiscussionForums.html

34.3K

Final Exam.html

31.5K

0_Final_Exam.html

79.8K

Home.html

62.8K

Problem Sets.html

105.9K

0_Problem_Set1.html

52.7K

1_Problem_Set2.html

53.7K

2_Problem_Set3.html

99.6K

3_Problem_Set4.html

86.4K

4_Problem_Set5.html

75.4K

5_Problem_Set6.html

62.6K

Programming Questions.html

47.6K

0_Programming_Question1.html

47.6K

zip_page.html

57.4K

1_Programming_Question__2.html

57.4K

zip_page.html

45.0K

2_Programming_Question__3.html

45.0K

zip_page.html

46.5K

3_Programming_Question4.html

46.5K

zip_page.html

44.9K

4_Programming_Question5.html

45.0K

zip_page.html

75.7K

5_Programming_Question__6.html

75.7K

zip_page.html

38.0K

Syllabus.html

95.4K

TheoryProblems.html

32.6K

assignment_home.html

80.5K

course_home.html

1.3M

entered_login.html

1 file

ITEM TILE

82 files

MPEG4

BACK

8.0M

01_Why_Study_Algorithms__4_min.mp4

16.9M

02_Integer_Multiplication_9_min.mp4

21.7M

03_Karatsuba_Multiplication_13_min.mp4

17.4M

04_About_the_Course_17_min.mp4

10.7M

05_Merge_Sort-_Motivation_and_Example_9_min.mp4

15.0M

06_Merge_Sort-_Pseudocode_13_min.mp4

11.3M

07_Merge_Sort-_Analysis_9_min.mp4

18.0M

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.mp4

27.7M

01_The_Gist_14_min.mp4

4.1M

02_Big-Oh_Notation_4_min.mp4

7.3M

03_Basic_Examples_7_min.mp4

7.5M

04_Big_Omega_and_Theta_7_min.mp4

7.7M

05_Additional_Examples_Review_-_Optional_8_min.mp4

12.9M

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.mp4

17.2M

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.mp4

23.6M

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.mp4

36.2M

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.mp4

20.1M

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.mp4

8.3M

01_Motivation_8_min.mp4

10.4M

02_Formal_Statement_10_min.mp4

14.4M

03_Examples_13_min.mp4

11.5M

04_Proof_I_10_min.mp4

13.1M

05_Interpretation_of_the_3_Cases_11_min.mp4

16.6M

06_Proof_II_16_min.mp4

12.2M

01_Quicksort-_Overview_12_min.mp4

24.8M

02_Partitioning_Around_a_Pivot_25_min.mp4

11.8M

03_Correctness_of_Quicksort_Review_-_Optional_11_min.mp4

21.7M

04_Choosing_a_Good_Pivot_22min.mp4

21.6M

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.mp4

12.0M

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.mp4

8.9M

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.mp4

25.4M

01_Part_I_Review_-_Optional_25_min.mp4

17.3M

02_Part_II_Review_-_Optional_17_min.mp4

21.4M

01_Randomized_Selection_-_Algorithm_22_min.mp4

20.6M

02_Randomized_Selection_-__Analysis_21_min.mp4

17.6M

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.mp4

22.8M

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.mp4

12.8M

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.mp4

13.7M

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.mp4

15.2M

01_Graphs_and_Minimum_Cuts_16_min.mp4

15.7M

02_Graph_Representations_14_min.mp4

8.3M

03_Random_Contraction_Algorithm_9_min.mp4

29.9M

04_Analysis_of_Contraction_Algorithm_30_min.mp4

7.4M

05_Counting_Minimum_Cuts_7_min.mp4

23.3M

01_Graph_Search_-_Overview_23_min.mp4

14.3M

02_Breadth-First_Search_BFS-_The_Basics_14_min.mp4

7.9M

03_BFS_and_Shortest_Paths_8_min.mp4

13.7M

04_BFS_and_Undirected_Connectivity_13_min.mp4

7.2M

05_Depth-First_Search_DFS-_The_Basics_7_min.mp4

22.1M

06_Topological_Sort_22_min.mp4

29.5M

07_Computing_Strong_Components-_The_Algorithm_29_min.mp4

26.8M

08_Computing_Strong_Components-_The_Analysis_26_min.mp4

18.6M

09_Structure_of_the_Web_Optional_19_min.mp4

21.0M

01_Dijkstras_Shortest-Path_Algorithm_21_min.mp4

12.9M

02_Dijkstras_Algorithm-_Examples_13_min.mp4

20.3M

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.mp4

26.5M

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.mp4

4.7M

01_Data_Structures-_Overview_5_min.mp4

18.6M

02_Heaps-_Operations_and_Applications_18_min.mp4

20.9M

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.mp4

11.0M

01_Balanced_Search_Trees-_Operations_and_Applications_11_min.mp4

13.3M

02_Binary_Search_Tree_Basics_Part_I_13_min.mp4

30.0M

03_Binary_Search_Tree_Basics_Part_II_30_min.mp4

21.8M

04_Red-Black_Trees_21_min.mp4

10.3M

05_Rotations_Advanced_-_Optional_8_min.mp4

20.8M

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.mp4

19.7M

01_Hash_Tables-_Operations_and_Applications_19_min.mp4

19.9M

02_Hash_Tables-_Implementation_Details_Part_I_19_min.mp4

22.5M

03_Hash_Tables-_Implementation_Details_Part_II_22_min.mp4

22.5M

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.mp4

26.2M

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.mp4

18.5M

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.mp4

15.6M

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.mp4

15.4M

01_Bloom_Filters-_The_Basics_16_min.mp4

13.6M

02_Bloom_Filters-_Heuristic_Analysis_13_min.mp4

13.8M

01_Application-_Internet_Routing_Optional_11_min.mp4

11.1M

02_Application-_Sequence_Alignment_Optional_9_min.mp4

18.0M

03_Introduction_to_Greedy_Algorithms_Optional_13_min.mp4

11.9M

04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.mp4

12.3M

05_Principles_of_Dynamic_Programming_Optional_8_min.mp4

14.3M

06_The_P_vs._NP_Question_Optional_9_min.mp4

19.9M

07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.mp4

82 files

OGG VIDEO

BACK

18.7M

01_Why_Study_Algorithms__4_min.ogv

37.8M

02_Integer_Multiplication_9_min.ogv

55.5M

03_Karatsuba_Multiplication_13_min.ogv

49.2M

04_About_the_Course_17_min.ogv

34.2M

05_Merge_Sort-_Motivation_and_Example_9_min.ogv

49.1M

06_Merge_Sort-_Pseudocode_13_min.ogv

35.7M

07_Merge_Sort-_Analysis_9_min.ogv

62.0M

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.ogv

62.8M

01_The_Gist_14_min.ogv

11.8M

02_Big-Oh_Notation_4_min.ogv

17.9M

03_Basic_Examples_7_min.ogv

20.6M

04_Big_Omega_and_Theta_7_min.ogv

17.6M

05_Additional_Examples_Review_-_Optional_8_min.ogv

34.1M

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.ogv

52.9M

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.ogv

64.7M

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.ogv

128.8M

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.ogv

52.9M

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.ogv

23.2M

01_Motivation_8_min.ogv

24.2M

02_Formal_Statement_10_min.ogv

48.8M

03_Examples_13_min.ogv

40.4M

04_Proof_I_10_min.ogv

43.6M

05_Interpretation_of_the_3_Cases_11_min.ogv

39.7M

06_Proof_II_16_min.ogv

31.1M

01_Quicksort-_Overview_12_min.ogv

67.0M

02_Partitioning_Around_a_Pivot_25_min.ogv

34.3M

03_Correctness_of_Quicksort_Review_-_Optional_11_min.ogv

70.3M

04_Choosing_a_Good_Pivot_22min.ogv

64.1M

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.ogv

33.7M

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.ogv

22.0M

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.ogv

63.6M

01_Part_I_Review_-_Optional_25_min.ogv

53.6M

02_Part_II_Review_-_Optional_17_min.ogv

64.5M

01_Randomized_Selection_-_Algorithm_22_min.ogv

67.9M

02_Randomized_Selection_-__Analysis_21_min.ogv

56.9M

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.ogv

71.5M

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.ogv

37.3M

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.ogv

44.8M

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.ogv

39.4M

01_Graphs_and_Minimum_Cuts_16_min.ogv

56.9M

02_Graph_Representations_14_min.ogv

18.3M

03_Random_Contraction_Algorithm_9_min.ogv

87.9M

04_Analysis_of_Contraction_Algorithm_30_min.ogv

20.1M

05_Counting_Minimum_Cuts_7_min.ogv

76.5M

01_Graph_Search_-_Overview_23_min.ogv

45.2M

02_Breadth-First_Search_BFS-_The_Basics_14_min.ogv

27.5M

03_BFS_and_Shortest_Paths_8_min.ogv

51.6M

04_BFS_and_Undirected_Connectivity_13_min.ogv

17.6M

05_Depth-First_Search_DFS-_The_Basics_7_min.ogv

74.0M

06_Topological_Sort_22_min.ogv

85.0M

07_Computing_Strong_Components-_The_Algorithm_29_min.ogv

87.5M

08_Computing_Strong_Components-_The_Analysis_26_min.ogv

50.8M

09_Structure_of_the_Web_Optional_19_min.ogv

66.8M

01_Dijkstras_Shortest-Path_Algorithm_21_min.ogv

39.2M

02_Dijkstras_Algorithm-_Examples_13_min.ogv

71.5M

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.ogv

82.0M

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.ogv

13.1M

01_Data_Structures-_Overview_5_min.ogv

58.7M

02_Heaps-_Operations_and_Applications_18_min.ogv

59.7M

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.ogv

34.7M

01_Balanced_Search_Trees-_Operations_and_Applications_11_min.ogv

41.3M

02_Binary_Search_Tree_Basics_Part_I_13_min.ogv

97.0M

03_Binary_Search_Tree_Basics_Part_II_30_min.ogv

47.7M

04_Red-Black_Trees_21_min.ogv

32.3M

05_Rotations_Advanced_-_Optional_8_min.ogv

61.0M

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.ogv

55.2M

01_Hash_Tables-_Operations_and_Applications_19_min.ogv

73.7M

02_Hash_Tables-_Implementation_Details_Part_I_19_min.ogv

71.5M

03_Hash_Tables-_Implementation_Details_Part_II_22_min.ogv

74.3M

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.ogv

81.2M

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.ogv

53.6M

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.ogv

37.1M

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.ogv

42.5M

01_Bloom_Filters-_The_Basics_16_min.ogv

43.7M

02_Bloom_Filters-_Heuristic_Analysis_13_min.ogv

44.8M

01_Application-_Internet_Routing_Optional_11_min.ogv

37.3M

02_Application-_Sequence_Alignment_Optional_9_min.ogv

53.9M

03_Introduction_to_Greedy_Algorithms_Optional_13_min.ogv

40.0M

04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.ogv

33.8M

05_Principles_of_Dynamic_Programming_Optional_8_min.ogv

38.3M

06_The_P_vs._NP_Question_Optional_9_min.ogv

55.2M

07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.ogv

160 files

PDF

BACK

215.8K

01_Why_Study_Algorithms__4_min.pdf

215.8K

01_Why_Study_Algorithms__4_min_0_PDF.pdf

611.0K

02_Integer_Multiplication_9_min.pdf

790.9K

02_Integer_Multiplication_9_min_0_PDF.pdf

677.2K

03_Karatsuba_Multiplication_13_min.pdf

1.2M

03_Karatsuba_Multiplication_13_min_0_PDF.pdf

731.4K

04_About_the_Course_17_min.pdf

259.5K

04_About_the_Course_17_min_0_PDF.pdf

697.1K

05_Merge_Sort-_Motivation_and_Example_9_min.pdf

632.6K

05_Merge_Sort-_Motivation_and_Example_9_min_0_PDF.pdf

663.9K

06_Merge_Sort-_Pseudocode_13_min.pdf

1.1M

06_Merge_Sort-_Pseudocode_13_min_0_PDF.pdf

720.6K

07_Merge_Sort-_Analysis_9_min.pdf

930.9K

07_Merge_Sort-_Analysis_9_min_0_PDF.pdf

554.0K

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.pdf

1.4M

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_0_PDF.pdf

273.4K

01_The_Gist_14_min.pdf

2.2M

01_The_Gist_14_min_0_PDF.pdf

812.0K

02_Big-Oh_Notation_4_min.pdf

660.3K

02_Big-Oh_Notation_4_min_0_PDF.pdf

337.6K

03_Basic_Examples_7_min.pdf

659.3K

03_Basic_Examples_7_min_0_PDF.pdf

989.5K

04_Big_Omega_and_Theta_7_min.pdf

868.6K

04_Big_Omega_and_Theta_7_min_0_PDF.pdf

822.4K

05_Additional_Examples_Review_-_Optional_8_min.pdf

1.0M

05_Additional_Examples_Review_-_Optional_8_min_0_PDF.pdf

915.1K

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.pdf

1.2M

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_0_PDF.pdf

452.4K

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.pdf

2.0M

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_0_PDF.pdf

1.8M

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.pdf

1.8M

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_0_PDF.pdf

2.1M

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.pdf

3.1M

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_0_PDF.pdf

3.9M

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.pdf

2.0M

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_0_PDF.pdf

456.6K

01_Motivation_8_min.pdf

1.4M

01_Motivation_8_min_0_PDF.pdf

362.2K

02_Formal_Statement_10_min.pdf

867.0K

02_Formal_Statement_10_min_0_PDF.pdf

855.2K

03_Examples_13_min.pdf

1.0M

03_Examples_13_min_0_PDF.pdf

944.4K

04_Proof_I_10_min.pdf

1.2M

04_Proof_I_10_min_0_PDF.pdf

277.0K

05_Interpretation_of_the_3_Cases_11_min.pdf

636.4K

05_Interpretation_of_the_3_Cases_11_min_0_PDF.pdf

825.7K

06_Proof_II_16_min.pdf

1.4M

06_Proof_II_16_min_0_PDF.pdf

1.3M

01_Quicksort-_Overview_12_min.pdf

1.1M

01_Quicksort-_Overview_12_min_0_PDF.pdf

3.9M

02_Partitioning_Around_a_Pivot_25_min.pdf

2.7M

02_Partitioning_Around_a_Pivot_25_min_0_PDF.pdf

1.0M

03_Correctness_of_Quicksort_Review_-_Optional_11_min.pdf

1.5M

03_Correctness_of_Quicksort_Review_-_Optional_11_min_0_PDF.pdf

1.5M

04_Choosing_a_Good_Pivot_22min.pdf

1.6M

04_Choosing_a_Good_Pivot_22min_0_PDF.pdf

1.4M

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.pdf

2.2M

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_0_PDF.pdf

301.4K

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.pdf

1.7M

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_0_PDF.pdf

83.7K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.pdf

1.0M

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_0_PDF.pdf

999.5K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_1_TYPED.pdf

1.5M

01_Part_I_Review_-_Optional_25_min.pdf

3.4M

01_Part_I_Review_-_Optional_25_min_0_PDF.pdf

1.2M

02_Part_II_Review_-_Optional_17_min.pdf

2.3M

02_Part_II_Review_-_Optional_17_min_0_PDF.pdf

1.9M

01_Randomized_Selection_-_Algorithm_22_min.pdf

2.6M

01_Randomized_Selection_-_Algorithm_22_min_0_PDF.pdf

2.0M

02_Randomized_Selection_-__Analysis_21_min.pdf

2.4M

02_Randomized_Selection_-__Analysis_21_min_0_PDF.pdf

92.6K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.pdf

3.7M

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_0_PDF.pdf

1.7M

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_1_TYPED.pdf

2.2M

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.pdf

3.7M

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_0_PDF.pdf

305.3K

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.pdf

4.5M

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_0_PDF.pdf

270.0K

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.pdf

1.2M

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_0_PDF.pdf

496.7K

01_Graphs_and_Minimum_Cuts_16_min.pdf

1.7M

01_Graphs_and_Minimum_Cuts_16_min_0_PDF.pdf

461.3K

02_Graph_Representations_14_min.pdf

1.8M

02_Graph_Representations_14_min_0_PDF.pdf

626.8K

03_Random_Contraction_Algorithm_9_min.pdf

1.1M

03_Random_Contraction_Algorithm_9_min_0_PDF.pdf

613.3K

04_Analysis_of_Contraction_Algorithm_30_min.pdf

3.6M

04_Analysis_of_Contraction_Algorithm_30_min_0_PDF.pdf

279.5K

05_Counting_Minimum_Cuts_7_min.pdf

1.0M

05_Counting_Minimum_Cuts_7_min_0_PDF.pdf

2.0M

01_Graph_Search_-_Overview_23_min.pdf

2.3M

01_Graph_Search_-_Overview_23_min_0_PDF.pdf

2.7M

02_Breadth-First_Search_BFS-_The_Basics_14_min.pdf

2.8M

02_Breadth-First_Search_BFS-_The_Basics_14_min_0_PDF.pdf

2.7M

03_BFS_and_Shortest_Paths_8_min.pdf

2.8M

03_BFS_and_Shortest_Paths_8_min_0_PDF.pdf

2.7M

04_BFS_and_Undirected_Connectivity_13_min.pdf

2.8M

04_BFS_and_Undirected_Connectivity_13_min_0_PDF.pdf

2.1M

05_Depth-First_Search_DFS-_The_Basics_7_min.pdf

3.1M

05_Depth-First_Search_DFS-_The_Basics_7_min_0_PDF.pdf

2.1M

06_Topological_Sort_22_min.pdf

3.1M

06_Topological_Sort_22_min_0_PDF.pdf

91.6K

07_Computing_Strong_Components-_The_Algorithm_29_min.pdf

2.7M

07_Computing_Strong_Components-_The_Algorithm_29_min_0_PDF.pdf

1.5M

07_Computing_Strong_Components-_The_Algorithm_29_min_1_TYPED.pdf

462.4K

08_Computing_Strong_Components-_The_Analysis_26_min.pdf

2.5M

08_Computing_Strong_Components-_The_Analysis_26_min_0_PDF.pdf

245.5K

09_Structure_of_the_Web_Optional_19_min.pdf

1.8M

09_Structure_of_the_Web_Optional_19_min_0_PDF.pdf

432.7K

01_Dijkstras_Shortest-Path_Algorithm_21_min.pdf

2.7M

01_Dijkstras_Shortest-Path_Algorithm_21_min_0_PDF.pdf

432.7K

02_Dijkstras_Algorithm-_Examples_13_min.pdf

2.7M

02_Dijkstras_Algorithm-_Examples_13_min_0_PDF.pdf

433.8K

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.pdf

2.8M

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_0_PDF.pdf

443.0K

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.pdf

3.4M

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_0_PDF.pdf

192.9K

01_Data_Structures-_Overview_5_min.pdf

844.4K

01_Data_Structures-_Overview_5_min_0_PDF.pdf

220.9K

02_Heaps-_Operations_and_Applications_18_min.pdf

2.1M

02_Heaps-_Operations_and_Applications_18_min_0_PDF.pdf

1.0M

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.pdf

2.1M

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_0_PDF.pdf

122.5K

01_Balanced_Search_Trees-_Operations_and_Applications_11_min.pdf

980.6K

01_Balanced_Search_Trees-_Operations_and_Applications_11_min_0_PDF.pdf

457.5K

02_Binary_Search_Tree_Basics_Part_I_13_min.pdf

4.8M

02_Binary_Search_Tree_Basics_Part_I_13_min_0_PDF.pdf

457.5K

03_Binary_Search_Tree_Basics_Part_II_30_min.pdf

4.8M

03_Binary_Search_Tree_Basics_Part_II_30_min_0_PDF.pdf

246.6K

04_Red-Black_Trees_21_min.pdf

2.3M

04_Red-Black_Trees_21_min_0_PDF.pdf

100.8K

05_Rotations_Advanced_-_Optional_8_min.pdf

869.0K

05_Rotations_Advanced_-_Optional_8_min_0_PDF.pdf

109.0K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.pdf

1.5M

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_0_PDF.pdf

223.6K

01_Hash_Tables-_Operations_and_Applications_19_min.pdf

1.6M

01_Hash_Tables-_Operations_and_Applications_19_min_0_PDF.pdf

1.6M

02_Hash_Tables-_Implementation_Details_Part_I_19_min.pdf

3.3M

02_Hash_Tables-_Implementation_Details_Part_I_19_min_0_PDF.pdf

1.6M

03_Hash_Tables-_Implementation_Details_Part_II_22_min.pdf

3.3M

03_Hash_Tables-_Implementation_Details_Part_II_22_min_0_PDF.pdf

122.2K

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.pdf

3.4M

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_0_PDF.pdf

771.9K

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.pdf

2.6M

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_0_PDf.pdf

369.7K

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.pdf

3.4M

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_0_PDF.pdf

152.5K

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.pdf

1.4M

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_0_PDF.pdf

185.9K

01_Bloom_Filters-_The_Basics_16_min.pdf

2.4M

01_Bloom_Filters-_The_Basics_16_min_0_PDF.pdf

185.9K

02_Bloom_Filters-_Heuristic_Analysis_13_min.pdf

2.4M

02_Bloom_Filters-_Heuristic_Analysis_13_min_0_PDF.pdf

1.4M

01_Application-_Internet_Routing_Optional_11_min.pdf

2.1M

02_Application-_Sequence_Alignment_Optional_9_min.pdf

1.7M

03_Introduction_to_Greedy_Algorithms_Optional_13_min.pdf

1.7M

04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.pdf

862.1K

05_Principles_of_Dynamic_Programming_Optional_8_min.pdf

1.3M

06_The_P_vs._NP_Question_Optional_9_min.pdf

1.1M

07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.pdf

70 files

POWERPOINT

BACK

281.7K

01_Why_Study_Algorithms__4_min.pptx

446.9K

04_About_the_Course_17_min.pptx

796.0K

05_Merge_Sort-_Motivation_and_Example_9_min.pptx

1.3M

06_Merge_Sort-_Pseudocode_13_min.pptx

1.1M

07_Merge_Sort-_Analysis_9_min.pptx

1.6M

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.pptx

869.1K

02_Big-Oh_Notation_4_min.pptx

860.4K

03_Basic_Examples_7_min.pptx

1.1M

04_Big_Omega_and_Theta_7_min.pptx

1.3M

05_Additional_Examples_Review_-_Optional_8_min.pptx

1.5M

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.pptx

2.2M

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.pptx

2.0M

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.pptx

3.2M

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.pptx

2.2M

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.pptx

1.5M

01_Motivation_8_min.pptx

1.0M

02_Formal_Statement_10_min.pptx

1.2M

03_Examples_13_min.pptx

1.4M

04_Proof_I_10_min.pptx

881.2K

05_Interpretation_of_the_3_Cases_11_min.pptx

1.6M

06_Proof_II_16_min.pptx

1.4M

01_Quicksort-_Overview_12_min.pptx

3.0M

02_Partitioning_Around_a_Pivot_25_min.pptx

1.7M

03_Correctness_of_Quicksort_Review_-_Optional_11_min.pptx

1.9M

04_Choosing_a_Good_Pivot_22min.pptx

2.5M

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.pptx

2.0M

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.pptx

1.3M

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.pptx

3.4M

01_Part_I_Review_-_Optional_25_min.pptx

2.7M

02_Part_II_Review_-_Optional_17_min.pptx

3.0M

01_Randomized_Selection_-_Algorithm_22_min.pptx

2.7M

02_Randomized_Selection_-__Analysis_21_min.pptx

1.9M

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.pptx

2.3M

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.pptx

1.4M

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.pptx

1.6M

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.pptx

2.0M

01_Graphs_and_Minimum_Cuts_16_min.pptx

1.8M

02_Graph_Representations_14_min.pptx

1.4M

03_Random_Contraction_Algorithm_9_min.pptx

4.0M

04_Analysis_of_Contraction_Algorithm_30_min.pptx

1.2M

05_Counting_Minimum_Cuts_7_min.pptx

2.6M

01_Graph_Search_-_Overview_23_min.pptx

3.2M

02_Breadth-First_Search_BFS-_The_Basics_14_min.pptx

3.2M

03_BFS_and_Shortest_Paths_8_min.pptx

3.2M

04_BFS_and_Undirected_Connectivity_13_min.pptx

3.5M

05_Depth-First_Search_DFS-_The_Basics_7_min.pptx

3.5M

06_Topological_Sort_22_min.pptx

2.4M

07_Computing_Strong_Components-_The_Algorithm_29_min.pptx

2.8M

08_Computing_Strong_Components-_The_Analysis_26_min.pptx

2.0M

09_Structure_of_the_Web_Optional_19_min.pptx

3.0M

01_Dijkstras_Shortest-Path_Algorithm_21_min.pptx

3.0M

02_Dijkstras_Algorithm-_Examples_13_min.pptx

3.2M

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.pptx

3.8M

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.pptx

1.0M

01_Data_Structures-_Overview_5_min.pptx

2.4M

02_Heaps-_Operations_and_Applications_18_min.pptx

2.4M

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.pptx

1.2M

01_Balanced_Search_Trees-_Operations_and_Applications_11_min.pptx

5.2M

02_Binary_Search_Tree_Basics_Part_I_13_min.pptx

5.2M

03_Binary_Search_Tree_Basics_Part_II_30_min.pptx

2.6M

04_Red-Black_Trees_21_min.pptx

1.8M

01_Hash_Tables-_Operations_and_Applications_19_min.pptx

3.7M

02_Hash_Tables-_Implementation_Details_Part_I_19_min.pptx

3.7M

03_Hash_Tables-_Implementation_Details_Part_II_22_min.pptx

3.6M

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.pptx

2.9M

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.pptx

3.2M

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.pptx

1.4M

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.pptx

2.4M

01_Bloom_Filters-_The_Basics_16_min.pptx

2.4M

02_Bloom_Filters-_Heuristic_Analysis_13_min.pptx

160 files

SINGLE PAGE PROCESSED JP2 ZIP

BACK

1,008.7K

01_Why_Study_Algorithms__4_min_0_PDF_jp2.zip

1,008.5K

01_Why_Study_Algorithms__4_min_jp2.zip

564.9K

02_Integer_Multiplication_9_min_0_PDF_jp2.zip

938.2K

02_Integer_Multiplication_9_min_jp2.zip

731.4K

03_Karatsuba_Multiplication_13_min_0_PDF_jp2.zip

1.2M

03_Karatsuba_Multiplication_13_min_jp2.zip

3.4M

04_About_the_Course_17_min_0_PDF_jp2.zip

3.4M

04_About_the_Course_17_min_jp2.zip

623.1K

05_Merge_Sort-_Motivation_and_Example_9_min_0_PDF_jp2.zip

1.1M

05_Merge_Sort-_Motivation_and_Example_9_min_jp2.zip

1,016.4K

06_Merge_Sort-_Pseudocode_13_min_0_PDF_jp2.zip

1.5M

06_Merge_Sort-_Pseudocode_13_min_jp2.zip

1.0M

07_Merge_Sort-_Analysis_9_min_0_PDF_jp2.zip

834.9K

07_Merge_Sort-_Analysis_9_min_jp2.zip

2.1M

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_0_PDF_jp2.zip

1.4M

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_jp2.zip

1.3M

01_The_Gist_14_min_0_PDF_jp2.zip

484.9K

01_The_Gist_14_min_jp2.zip

434.2K

02_Big-Oh_Notation_4_min_0_PDF_jp2.zip

763.0K

02_Big-Oh_Notation_4_min_jp2.zip

416.5K

03_Basic_Examples_7_min_0_PDF_jp2.zip

702.6K

03_Basic_Examples_7_min_jp2.zip

962.1K

04_Big_Omega_and_Theta_7_min_0_PDF_jp2.zip

1.3M

04_Big_Omega_and_Theta_7_min_jp2.zip

689.4K

05_Additional_Examples_Review_-_Optional_8_min_0_PDF_jp2.zip

1.1M

05_Additional_Examples_Review_-_Optional_8_min_jp2.zip

899.6K

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_0_PDF_jp2.zip

1.5M

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_jp2.zip

1.4M

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_0_PDF_jp2.zip

2.6M

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_jp2.zip

1.4M

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_0_PDF_jp2.zip

2.4M

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_jp2.zip

1.9M

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_0_PDF_jp2.zip

3.1M

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_jp2.zip

1.1M

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_0_PDF_jp2.zip

2.0M

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_jp2.zip

1.1M

01_Motivation_8_min_0_PDF_jp2.zip

1.7M

01_Motivation_8_min_jp2.zip

648.4K

02_Formal_Statement_10_min_0_PDF_jp2.zip

892.0K

02_Formal_Statement_10_min_jp2.zip

1.1M

03_Examples_13_min_0_PDF_jp2.zip

725.9K

03_Examples_13_min_jp2.zip

917.8K

04_Proof_I_10_min_0_PDF_jp2.zip

1.4M

04_Proof_I_10_min_jp2.zip

740.0K

05_Interpretation_of_the_3_Cases_11_min_0_PDF_jp2.zip

1.2M

05_Interpretation_of_the_3_Cases_11_min_jp2.zip

1.2M

06_Proof_II_16_min_0_PDF_jp2.zip

1.8M

06_Proof_II_16_min_jp2.zip

1.0M

01_Quicksort-_Overview_12_min_0_PDF_jp2.zip

928.4K

01_Quicksort-_Overview_12_min_jp2.zip

1.6M

02_Partitioning_Around_a_Pivot_25_min_0_PDF_jp2.zip

1.5M

02_Partitioning_Around_a_Pivot_25_min_jp2.zip

885.1K

03_Correctness_of_Quicksort_Review_-_Optional_11_min_0_PDF_jp2.zip

1.5M

03_Correctness_of_Quicksort_Review_-_Optional_11_min_jp2.zip

1.2M

04_Choosing_a_Good_Pivot_22min_0_PDF_jp2.zip

2.3M

04_Choosing_a_Good_Pivot_22min_jp2.zip

1.6M

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_0_PDF_jp2.zip

2.6M

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_jp2.zip

1.1M

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_0_PDF_jp2.zip

1.7M

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_jp2.zip

709.2K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_0_PDF_jp2.zip

1.1M

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_1_TYPED_jp2.zip

1.4M

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_jp2.zip

2.5M

01_Part_I_Review_-_Optional_25_min_0_PDF_jp2.zip

4.2M

01_Part_I_Review_-_Optional_25_min_jp2.zip

1.5M

02_Part_II_Review_-_Optional_17_min_0_PDF_jp2.zip

2.3M

02_Part_II_Review_-_Optional_17_min_jp2.zip

2.0M

01_Randomized_Selection_-_Algorithm_22_min_0_PDF_jp2.zip

3.3M

01_Randomized_Selection_-_Algorithm_22_min_jp2.zip

1.5M

02_Randomized_Selection_-__Analysis_21_min_0_PDF_jp2.zip

2.3M

02_Randomized_Selection_-__Analysis_21_min_jp2.zip

2.9M

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_0_PDF_jp2.zip

2.2M

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_1_TYPED_jp2.zip

2.3M

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_jp2.zip

2.9M

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_0_PDF_jp2.zip

2.9M

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_jp2.zip

3.5M

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_0_PDF_jp2.zip

1.2M

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_jp2.zip

790.8K

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_0_PDF_jp2.zip

1.3M

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_jp2.zip

1.2M

01_Graphs_and_Minimum_Cuts_16_min_0_PDF_jp2.zip

2.2M

01_Graphs_and_Minimum_Cuts_16_min_jp2.zip

1.3M

02_Graph_Representations_14_min_0_PDF_jp2.zip

2.1M

02_Graph_Representations_14_min_jp2.zip

753.6K

03_Random_Contraction_Algorithm_9_min_0_PDF_jp2.zip

1.4M

03_Random_Contraction_Algorithm_9_min_jp2.zip

2.2M

04_Analysis_of_Contraction_Algorithm_30_min_0_PDF_jp2.zip

3.3M

04_Analysis_of_Contraction_Algorithm_30_min_jp2.zip

665.9K

05_Counting_Minimum_Cuts_7_min_0_PDF_jp2.zip

1.0M

05_Counting_Minimum_Cuts_7_min_jp2.zip

1.2M

01_Graph_Search_-_Overview_23_min_0_PDF_jp2.zip

2.2M

01_Graph_Search_-_Overview_23_min_jp2.zip

1.6M

02_Breadth-First_Search_BFS-_The_Basics_14_min_0_PDF_jp2.zip

3.0M

02_Breadth-First_Search_BFS-_The_Basics_14_min_jp2.zip

1.6M

03_BFS_and_Shortest_Paths_8_min_0_PDF_jp2.zip

3.0M

03_BFS_and_Shortest_Paths_8_min_jp2.zip

1.6M

04_BFS_and_Undirected_Connectivity_13_min_0_PDF_jp2.zip

3.0M

04_BFS_and_Undirected_Connectivity_13_min_jp2.zip

1.7M

05_Depth-First_Search_DFS-_The_Basics_7_min_0_PDF_jp2.zip

3.2M

05_Depth-First_Search_DFS-_The_Basics_7_min_jp2.zip

1.7M

06_Topological_Sort_22_min_0_PDF_jp2.zip

3.2M

06_Topological_Sort_22_min_jp2.zip

2.0M

07_Computing_Strong_Components-_The_Algorithm_29_min_0_PDF_jp2.zip

1.3M

07_Computing_Strong_Components-_The_Algorithm_29_min_1_TYPED_jp2.zip

1.9M

07_Computing_Strong_Components-_The_Algorithm_29_min_jp2.zip

1.5M

08_Computing_Strong_Components-_The_Analysis_26_min_0_PDF_jp2.zip

2.6M

08_Computing_Strong_Components-_The_Analysis_26_min_jp2.zip

1.0M

09_Structure_of_the_Web_Optional_19_min_0_PDF_jp2.zip

870.2K

09_Structure_of_the_Web_Optional_19_min_jp2.zip

1.5M

01_Dijkstras_Shortest-Path_Algorithm_21_min_0_PDF_jp2.zip

2.7M

01_Dijkstras_Shortest-Path_Algorithm_21_min_jp2.zip

1.5M

02_Dijkstras_Algorithm-_Examples_13_min_0_PDF_jp2.zip

2.7M

02_Dijkstras_Algorithm-_Examples_13_min_jp2.zip

1.5M

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_0_PDF_jp2.zip

2.2M

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_jp2.zip

1.8M

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_0_PDF_jp2.zip

3.0M

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_jp2.zip

500.6K

01_Data_Structures-_Overview_5_min_0_PDF_jp2.zip

871.0K

01_Data_Structures-_Overview_5_min_jp2.zip

1.2M

02_Heaps-_Operations_and_Applications_18_min_0_PDF_jp2.zip

2.4M

02_Heaps-_Operations_and_Applications_18_min_jp2.zip

1.4M

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_0_PDF_jp2.zip

2.4M

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_jp2.zip

599.4K

01_Balanced_Search_Trees-_Operations_and_Applications_11_min_0_PDF_jp2.zip

529.2K

01_Balanced_Search_Trees-_Operations_and_Applications_11_min_jp2.zip

2.8M

02_Binary_Search_Tree_Basics_Part_I_13_min_0_PDF_jp2.zip

2.3M

02_Binary_Search_Tree_Basics_Part_I_13_min_jp2.zip

2.8M

03_Binary_Search_Tree_Basics_Part_II_30_min_0_PDF_jp2.zip

2.3M

03_Binary_Search_Tree_Basics_Part_II_30_min_jp2.zip

1.5M

04_Red-Black_Trees_21_min_0_PDF_jp2.zip

1.2M

04_Red-Black_Trees_21_min_jp2.zip

989.9K

05_Rotations_Advanced_-_Optional_8_min_0_PDF_jp2.zip

162.0K

05_Rotations_Advanced_-_Optional_8_min_jp2.zip

733.7K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_0_PDF_jp2.zip

251.7K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_jp2.zip

972.5K

01_Hash_Tables-_Operations_and_Applications_19_min_0_PDF_jp2.zip

1.8M

01_Hash_Tables-_Operations_and_Applications_19_min_jp2.zip

2.0M

02_Hash_Tables-_Implementation_Details_Part_I_19_min_0_PDF_jp2.zip

3.7M

02_Hash_Tables-_Implementation_Details_Part_I_19_min_jp2.zip

2.0M

03_Hash_Tables-_Implementation_Details_Part_II_22_min_0_PDF_jp2.zip

3.7M

03_Hash_Tables-_Implementation_Details_Part_II_22_min_jp2.zip

2.0M

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_0_PDF_jp2.zip

1.7M

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_jp2.zip

1.7M

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_0_PDf_jp2.zip

2.9M

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_jp2.zip

2.0M

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_0_PDF_jp2.zip

1.7M

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_jp2.zip

1.0M

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_0_PDF_jp2.zip

1.0M

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_jp2.zip

1.5M

01_Bloom_Filters-_The_Basics_16_min_0_PDF_jp2.zip

2.7M

01_Bloom_Filters-_The_Basics_16_min_jp2.zip

1.5M

02_Bloom_Filters-_Heuristic_Analysis_13_min_0_PDF_jp2.zip

2.7M

02_Bloom_Filters-_Heuristic_Analysis_13_min_jp2.zip

1.7M

01_Application-_Internet_Routing_Optional_11_min_jp2.zip

1.1M

02_Application-_Sequence_Alignment_Optional_9_min_jp2.zip

1,007.2K

03_Introduction_to_Greedy_Algorithms_Optional_13_min_jp2.zip

942.3K

04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min_jp2.zip

1.8M

05_Principles_of_Dynamic_Programming_Optional_8_min_jp2.zip

1.3M

06_The_P_vs._NP_Question_Optional_9_min_jp2.zip

1.4M

07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min_jp2.zip

82 files

SUBRIP

BACK

5.7K

01_Why_Study_Algorithms__4_min.srt

11.0K

02_Integer_Multiplication_9_min.srt

17.1K

03_Karatsuba_Multiplication_13_min.srt

30.1K

04_About_the_Course_17_min.srt

13.2K

05_Merge_Sort-_Motivation_and_Example_9_min.srt

20.2K

06_Merge_Sort-_Pseudocode_13_min.srt

13.8K

07_Merge_Sort-_Analysis_9_min.srt

24.5K

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.srt

21.2K

01_The_Gist_14_min.srt

6.3K

02_Big-Oh_Notation_4_min.srt

11.1K

03_Basic_Examples_7_min.srt

11.7K

04_Big_Omega_and_Theta_7_min.srt

12.0K

05_Additional_Examples_Review_-_Optional_8_min.srt

20.1K

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.srt

27.3K

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.srt

31.4K

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.srt

52.0K

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.srt

29.1K

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.srt

12.3K

01_Motivation_8_min.srt

14.4K

02_Formal_Statement_10_min.srt

19.2K

03_Examples_13_min.srt

15.3K

04_Proof_I_10_min.srt

17.2K

05_Interpretation_of_the_3_Cases_11_min.srt

24.4K

06_Proof_II_16_min.srt

17.7K

01_Quicksort-_Overview_12_min.srt

36.8K

02_Partitioning_Around_a_Pivot_25_min.srt

14.0K

03_Correctness_of_Quicksort_Review_-_Optional_11_min.srt

34.9K

04_Choosing_a_Good_Pivot_22min.srt

33.3K

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.srt

17.3K

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.srt

12.1K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.srt

40.9K

01_Part_I_Review_-_Optional_25_min.srt

24.4K

02_Part_II_Review_-_Optional_17_min.srt

35.5K

01_Randomized_Selection_-_Algorithm_22_min.srt

31.2K

02_Randomized_Selection_-__Analysis_21_min.srt

27.8K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.srt

32.7K

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.srt

20.4K

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.srt

22.3K

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.srt

23.9K

01_Graphs_and_Minimum_Cuts_16_min.srt

21.7K

02_Graph_Representations_14_min.srt

13.6K

03_Random_Contraction_Algorithm_9_min.srt

42.6K

04_Analysis_of_Contraction_Algorithm_30_min.srt

9.6K

05_Counting_Minimum_Cuts_7_min.srt

38.1K

01_Graph_Search_-_Overview_23_min.srt

22.2K

02_Breadth-First_Search_BFS-_The_Basics_14_min.srt

11.8K

03_BFS_and_Shortest_Paths_8_min.srt

22.1K

04_BFS_and_Undirected_Connectivity_13_min.srt

12.3K

05_Depth-First_Search_DFS-_The_Basics_7_min.srt

33.1K

06_Topological_Sort_22_min.srt

46.2K

07_Computing_Strong_Components-_The_Algorithm_29_min.srt

39.5K

08_Computing_Strong_Components-_The_Analysis_26_min.srt

29.4K

09_Structure_of_the_Web_Optional_19_min.srt

32.2K

01_Dijkstras_Shortest-Path_Algorithm_21_min.srt

18.8K

02_Dijkstras_Algorithm-_Examples_13_min.srt

27.3K

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.srt

40.5K

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.srt

7.2K

01_Data_Structures-_Overview_5_min.srt

28.6K

02_Heaps-_Operations_and_Applications_18_min.srt

32.7K

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.srt

16.9K

01_Balanced_Search_Trees-_Operations_and_Applications_11_min.srt

20.9K

02_Binary_Search_Tree_Basics_Part_I_13_min.srt

47.5K

03_Binary_Search_Tree_Basics_Part_II_30_min.srt

35.3K

04_Red-Black_Trees_21_min.srt

10.4K

05_Rotations_Advanced_-_Optional_8_min.srt

21.3K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.srt

32.2K

01_Hash_Tables-_Operations_and_Applications_19_min.srt

31.6K

02_Hash_Tables-_Implementation_Details_Part_I_19_min.srt

36.7K

03_Hash_Tables-_Implementation_Details_Part_II_22_min.srt

35.2K

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.srt

39.4K

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.srt

28.4K

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.srt

25.0K

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.srt

26.4K

01_Bloom_Filters-_The_Basics_16_min.srt

20.0K

02_Bloom_Filters-_Heuristic_Analysis_13_min.srt

17.8K

01_Application-_Internet_Routing_Optional_11_min.srt

13.0K

02_Application-_Sequence_Alignment_Optional_9_min.srt

21.8K

03_Introduction_to_Greedy_Algorithms_Optional_13_min.srt

14.2K

04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.srt

12.3K

05_Principles_of_Dynamic_Programming_Optional_8_min.srt

13.3K

06_The_P_vs._NP_Question_Optional_9_min.srt

20.5K

07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.srt

107 files

TEXT

BACK

3.8K

01_Why_Study_Algorithms__4_min.txt

7.4K

02_Integer_Multiplication_9_min.txt

11.4K

03_Karatsuba_Multiplication_13_min.txt

20.6K

04_About_the_Course_17_min.txt

10.1K

05_Merge_Sort-_Motivation_and_Example_9_min.txt

13.8K

06_Merge_Sort-_Pseudocode_13_min.txt

9.5K

07_Merge_Sort-_Analysis_9_min.txt

16.7K

08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.txt

14.1K

01_The_Gist_14_min.txt

4.3K

02_Big-Oh_Notation_4_min.txt

7.6K

03_Basic_Examples_7_min.txt

8.0K

04_Big_Omega_and_Theta_7_min.txt

8.2K

05_Additional_Examples_Review_-_Optional_8_min.txt

13.8K

01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.txt

18.5K

02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.txt

21.4K

03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.txt

36.3K

04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.txt

19.9K

05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.txt

8.4K

01_Motivation_8_min.txt

9.9K

02_Formal_Statement_10_min.txt

13.1K

03_Examples_13_min.txt

10.5K

04_Proof_I_10_min.txt

11.8K

05_Interpretation_of_the_3_Cases_11_min.txt

16.8K

06_Proof_II_16_min.txt

12.2K

01_Quicksort-_Overview_12_min.txt

25.0K

02_Partitioning_Around_a_Pivot_25_min.txt

9.6K

03_Correctness_of_Quicksort_Review_-_Optional_11_min.txt

23.9K

04_Choosing_a_Good_Pivot_22min.txt

22.7K

01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.txt

10.9K

02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.txt

8.3K

03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.txt

28.0K

01_Part_I_Review_-_Optional_25_min.txt

16.7K

02_Part_II_Review_-_Optional_17_min.txt

24.3K

01_Randomized_Selection_-_Algorithm_22_min.txt

21.3K

02_Randomized_Selection_-__Analysis_21_min.txt

19.0K

03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.txt

22.4K

04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.txt

14.0K

05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.txt

15.3K

06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.txt

16.3K

01_Graphs_and_Minimum_Cuts_16_min.txt

15.2K

02_Graph_Representations_14_min.txt

9.3K

03_Random_Contraction_Algorithm_9_min.txt

28.9K

04_Analysis_of_Contraction_Algorithm_30_min.txt

6.5K

05_Counting_Minimum_Cuts_7_min.txt

26.1K

01_Graph_Search_-_Overview_23_min.txt

15.2K

02_Breadth-First_Search_BFS-_The_Basics_14_min.txt

8.2K

03_BFS_and_Shortest_Paths_8_min.txt

15.1K

04_BFS_and_Undirected_Connectivity_13_min.txt

8.4K

05_Depth-First_Search_DFS-_The_Basics_7_min.txt

22.6K

06_Topological_Sort_22_min.txt

31.6K

07_Computing_Strong_Components-_The_Algorithm_29_min.txt

26.9K

08_Computing_Strong_Components-_The_Analysis_26_min.txt

20.1K

09_Structure_of_the_Web_Optional_19_min.txt

22.0K

01_Dijkstras_Shortest-Path_Algorithm_21_min.txt

12.9K

02_Dijkstras_Algorithm-_Examples_13_min.txt

18.7K

03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.txt

27.7K

04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.txt

4.9K

01_Data_Structures-_Overview_5_min.txt

19.6K

02_Heaps-_Operations_and_Applications_18_min.txt

22.4K

03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.txt

11.6K

01_Balanced_Search_Trees-_Operations_and_Applications_11_min.txt

14.3K

02_Binary_Search_Tree_Basics_Part_I_13_min.txt

32.5K

03_Binary_Search_Tree_Basics_Part_II_30_min.txt

22.9K

04_Red-Black_Trees_21_min.txt

7.0K

05_Rotations_Advanced_-_Optional_8_min.txt

14.2K

06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.txt

22.0K

01_Hash_Tables-_Operations_and_Applications_19_min.txt

21.6K

02_Hash_Tables-_Implementation_Details_Part_I_19_min.txt

25.1K

03_Hash_Tables-_Implementation_Details_Part_II_22_min.txt

24.0K

01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.txt

26.9K

02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.txt

19.4K

03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.txt

17.1K

04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.txt

18.0K

01_Bloom_Filters-_The_Basics_16_min.txt

13.7K

02_Bloom_Filters-_Heuristic_Analysis_13_min.txt

11.9K

01_Application-_Internet_Routing_Optional_11_min.txt

8.8K

02_Application-_Sequence_Alignment_Optional_9_min.txt

14.5K

03_Introduction_to_Greedy_Algorithms_Optional_13_min.txt

9.4K

04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.txt

8.2K

05_Principles_of_Dynamic_Programming_Optional_8_min.txt

8.8K

06_The_P_vs._NP_Question_Optional_9_min.txt

13.7K

07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.txt

1.5K

links.txt

2.7K

links.txt

1.6K

links.txt

1.9K

links.txt

1.6K

links.txt

1.6K

links.txt

1.6K

links.txt

1.6K

links.txt

1.6K

links.txt

1.6K

links.txt

672.7K

IntegerArray.txt

1.6K

links.txt

57.5K

QuickSort.txt

1.6K

links.txt

18.1K

kargerMinCut.txt

1.6K

links.txt

69.3M

SCC.txt

1.7K

links.txt

31.5K

dijkstraData.txt

1.6K

links.txt

57.5K

Median.txt

11.8M

algo1%2Fprogramming_prob%2F2sum.txt

1.7K

links.txt

1.5K

links.txt

1.5K

links.txt

1 file

TORRENT

1 file

ZIP

1668 Files
7 Original

SHOW ALL

IN COLLECTIONS

Academic Torrents

The Dataset Collection

Uploaded by arkiver2 on August 12, 2018

[Coursera] Algorithms: Design and Analysis, Part 1 (Stanford University) (algo)

Movies Preview

Flag this item for

[Coursera] Algorithms: Design and Analysis, Part 1 (Stanford University) (algo)

plus-circle Add Review comment Reviews

DOWNLOAD OPTIONS

IN COLLECTIONS

SIMILAR ITEMS (based on metadata)

plus-circle Add Review

comment
Reviews