Skip to content

Latest commit

 

History

History
34 lines (25 loc) · 831 Bytes

README.md

File metadata and controls

34 lines (25 loc) · 831 Bytes

Visualizer

A visualizer for the algorithms and data structures taught in CSE 12, 100, and 101 at UCSD. Can be viewed here - Visualizer

Completed -

  • PathFinding Algorithms
    1. Depth First Search
    2. Breadth First Search
    3. Dijkstra's (Uniform Cost Search) Algorithm
    4. A*

In Progress -

  • Sorting Algorithms
    1. Bubble Sort - Bubble the largest to the end in first iteration. Bubble the second largest to the end in the second iteration and so on... untill the whole array is sorted.
    2. Merge Sort
    3. Quick Sort

Pushed Trees for later (need help on css)

  • Trees
    1. Binary Search Trees
    2. Tree Traversals and their uses (w/ Leetcode Problems)
      • Level Order
      • Pre-Order
      • Post-Order
      • In-Order

Planned -

  • Linked List
  • Hash Maps