← RETURN TO FLEET REGISTRY
PROJECT SELECTOR:

ALGORITHM VISUALIZER

Interactive Sorting & Pathfinding Algorithm Visualization | C# Windows Forms (.NET)

Algorithm Visualizer Desktop Application

Interactive Sorting & Pathfinding Algorithm Visualization | C# Windows Forms (.NET)

PROJECT OVERVIEW

The Algorithm Visualizer is an interactive desktop application developed using C# and Windows Forms (.NET) as part of my Visual Programming coursework at the University of Kelaniya. The primary objective of this project is to demonstrate how fundamental computer science algorithms operate through step-by-step graphical visualizations, making complex algorithmic processes easier to understand and analyze.

The application combines algorithm implementation with interactive graphical interfaces to provide users with a practical understanding of sorting and pathfinding techniques. Instead of simply displaying the final output, it visually demonstrates each stage of algorithm execution through animated graphics, allowing users to observe comparisons, element movements, node exploration, and path construction in real time.

The application follows an object-oriented design approach and uses GDI+ graphics rendering, event-driven programming, and Timer-based animations to create an interactive and responsive user experience.

KEY FEATURES AND FUNCTIONALITIES

1. Sorting Algorithm Visualizer

The Sorting Visualizer module provides an animated graphical representation of sorting algorithms. It allows users to generate random datasets and observe how different sorting techniques organize data into ascending order.

Implemented Algorithms:
  • Insertion Sort: Demonstrates how elements are selected, compared with previous elements, and inserted into their correct positions within the sorted portion of the array.
  • Quick Sort: Visualizes the divide-and-conquer sorting technique by selecting pivot elements, partitioning the array, and recursively sorting smaller sections.
Main Functionalities:
  • Real-time animated bar chart representation of array elements.
  • Dynamic random array generation.
  • Adjustable array size through the settings interface.
  • Configurable animation speed to control visualization timing.
  • Color-coded graphical representation of comparisons, swaps, active elements, and pivot selection.
  • Interactive algorithm selection.
  • Dedicated settings window for customizing visualization parameters.

This module helps users understand the differences between sorting algorithms by observing their execution processes visually.

2. Pathfinding Algorithm Visualizer

The Pathfinding Visualizer module demonstrates how search algorithms navigate through a two-dimensional grid to discover the shortest available path between two points.

Implemented Algorithm:
  • Breadth-First Search (BFS): Uses a queue-based searching approach to explore neighboring nodes level by level and identify the shortest path in an unweighted grid.
Main Functionalities:
  • Interactive 20 × 20 grid-based environment.
  • Ability to place and configure starting and destination nodes.
  • Interactive wall placement to create obstacles.
  • Animated node exploration during algorithm execution.
  • Visual representation of visited nodes and explored areas.
  • Highlighting of the final shortest path once the algorithm completes.
  • Configurable animation speed and grid-related settings.

The module provides a practical demonstration of how Breadth-First Search explores possible routes and finds an optimal path while avoiding obstacles.

3. Application Architecture and User Interface

The application is designed using a multi-form architecture, separating different functionalities into dedicated Windows Forms.

The main interface provides navigation to the Sorting Visualizer and Pathfinding Visualizer modules. Each module includes its own interactive controls and visualization environment, while separate settings forms allow users to customize application behavior.

The graphical components are rendered using GDI+, providing dynamic visual updates during algorithm execution. Timer-based animations control the visualization sequence, enabling users to follow algorithm operations step by step.

TECHNOLOGIES AND TECHNICAL CONCEPTS

Programming Language & Framework
  • C#
  • .NET Framework / Windows Forms
Graphics and User Interface
  • Windows Forms GUI Development
  • GDI+ Graphics Rendering
  • Custom Graphical Drawing
  • Event-Driven Programming
  • Timer-Based Animations
Algorithms and Data Structures
  • Insertion Sort
  • Quick Sort
  • Breadth-First Search (BFS)
  • Arrays
  • Queue Data Structure
  • Stack Data Structure
  • Two-Dimensional Grid Representation
Software Development Concepts
  • Object-Oriented Programming (OOP)
  • Multi-Form Application Architecture
  • Event Handling
  • Algorithm Implementation
  • Interactive User Interface Design
  • Application State Management

LEARNING OUTCOMES AND EXPERIENCE

Developing this project provided valuable hands-on experience in combining theoretical computer science concepts with practical software development.

Through the implementation of sorting and pathfinding algorithms, I gained a deeper understanding of algorithm execution, data manipulation, searching techniques, and the role of data structures in solving computational problems.

I also improved my skills in C# programming, Windows Forms application development, graphical rendering using GDI+, and implementing smooth animations through timer-based execution.

One of the most valuable aspects of this project was learning how to transform complex algorithmic operations into understandable visual representations. Designing multiple forms, managing user interactions, and coordinating graphical updates helped strengthen my problem-solving abilities and understanding of desktop application architecture.

CONCLUSION

The Algorithm Visualizer demonstrates my ability to develop interactive desktop applications while applying fundamental concepts of algorithms, data structures, object-oriented programming, and graphical user interface development.

This project represents an important step in my software development journey, allowing me to combine logical problem-solving with creative interface design to build a practical educational application that makes algorithm learning more interactive and engaging.

SIMULATION ALGORITHM VISUALIZER.EXE
INTERACTIVE MODE [ACTIVE]