Algorithm Visualiser for Coin Changing Problem

Main Article Content

Atharva Rajmane
Vatsal Upadhyay
Dhruv Shah
Neha Agarwal

Abstract

The goal of this research project is to create an interactive analytical and teaching tool in the form of an algorithm visualizer application. The main objective is to improve users' comprehension of the differences between the Greedy Method and the Dynamic Programming Method when addressing the coin change problem by providing a visual depiction of each method's step-by-step implementation. The primary task at hand is developing a user-friendly and educational interface that facilitates the selection of algorithms, customization of input data or graphs, and real-time observation of algorithmic processes by users. Through interactive visualization approaches, the project's output is anticipated to be a useful tool for educators and learners alike, aiding in the understanding of intricate algorithmic principles.

Downloads

Download data is not yet available.

Article Details

How to Cite
Atharva Rajmane, Vatsal Upadhyay, Dhruv Shah, & Neha Agarwal. (2024). Algorithm Visualiser for Coin Changing Problem. Educational Administration: Theory and Practice, 30(1), 5363–5368. https://doi.org/10.53555/kuey.v30i1.8943
Section
Articles
Author Biographies

Atharva Rajmane

Information Technology Department, Dwarkadas J Sanghvi College of Engineering, Mumbai -56, Maharashtra, India

Vatsal Upadhyay

Information Technology Department, Dwarkadas J Sanghvi College of Engineering, Mumbai -56, Maharashtra, India

Dhruv Shah

Information Technology Department Dwarkadas J Sanghvi College of Engineering, Mumbai -56, Maharashtra, India

Neha Agarwal

Information Technology Department, Dwarkadas J Sanghvi College of Engineering, Mumbai -56, Maharashtra, India