Visualising Various Algorithms

This week, we’re stepping back from our usual coding challenges to dive into the visual side of algorithms! We'll be using Algovis to explore and understand how various algorithms operate under the hood. This session will focus on visualizing the flow and logic of different sorting, graph, pathfinding, and data structure algorithms. It’s a great chance to see these concepts in action and discuss them with fellow coders in real-time.
Here’s what we’ll be visualizing:
Sorting Algorithms

• Get a sense of how different sorting methods work with algorithms like Bogosort, Bubblesort, Cocktail Shaker Sort, Comb Sort, Counting Sort, Gnomesort, Insertion Sort, Quicksort, Radix Sort, and Selection Sort.

Graph Algorithms

• Dive into the world of graphs with Breadth-First Search, Depth-First Search, Kosaraju’s Algorithm, Kruskal’s Algorithm, Prim’s Algorithm, and Tarjan’s Algorithm.

Pathfinding and Maze Generation

• Discover the paths taken by algorithms like A*, Breadth-First Search, Depth-First Search, and Dijkstra’s Algorithm. For maze generation, we’ll explore Recursive DFS, Growing Tree Algorithm, Binary Tree Algorithm, and Sidewinder Algorithm.

Data Structures

• Visualize how fundamental data structures like Doubly Linked Lists, Hash Tables, Linked Lists, and Stacks are built and operate.

Join us for a hands-on, interactive session that’s sure to bring these algorithms to life. Whether you’re new to these concepts or looking for a deeper understanding, this meetup will provide valuable insights!