Small Steps Hub

Code Sorts by Programming Concepts

• Introduction & Basics

  • w1_introdatastruct.py
  • w2_algorithm.ipynb
  • w2_asymptotic_notations.ipynb

• Arrays & Searching

  • z_arrays.py
  • z_linear_search.py
  • z_binary_search.py
  • z_recursive_binary_search.py

• Linked Lists

  • z_linked_list.py
  • z_linked_list_merge_sort.py

• Sorting Algorithms

  • w3_merge_sort.py
  • w3_quick_sort.py
  • w4_counting_sort.py
  • w4_radix_sort.py
  • z_merge_sort.py
  • z_stableQuickSort.ipynb

• Trees & Heaps

  • w5_AVL_tree.ipynb
  • w5_key_tree.ipynb
  • w6_heap.ipynb
  • w6_binomial_heap.ipynb
  • w8_mergeHeap.py

• Algorithmic Paradigms & Dynamic Programming

  • w7_alrogithmic_paradigm.ipynb
  • w7_dynamic_programming.ipynb
  • w8_ch.7_Knapscak.ipynb
  • w8_merge_sort_tc.ipynb
  • w4_solve_equation.ipynb

• Graphs & Greedy Algorithms

  • w9_ch.8_greedyAlgorithm.ipynb
  • w10_Divide-and-Conquer.ipynb
  • w11_DFS.ipynb
  • w12_MST_MinimalSpanningTree.ipynb
  • w12_ShortestPath.ipynb

• Homework & Exam Preparation

  • w3_hw_leetcode88.py
  • w8_HomeworkBeforeMidterm.ipynb
  • w12_finalExamPrep.ipynb
  • z_summerize.ipynb