“Improving Algorithm Learning and Understanding through

Interactive Visualizations: A Web-Based Tool for Algorithm

Visualization”

A Major Project Report Submitted to

Rajiv Gandhi Proudyogiki
Vishwavidyalaya

Towards Partial Fulfillment for the Award of

Bachelor of Technology in Information Technology

Submitted by: Guided by:

Aman Jaiswal (0827IT201015) Prof. Kapil Sahu
Animesh Verma (0827IT201020) Information Technology
Bhomik Tiwari (0827IT201035)
AITR, Indore
Devang Runwal (0827IT201041)
 EXAMINER APPROVAL

The Project entitled “Improving Algorithm Learning and Understanding through

Interactive Visualizations: A Web-Based Tool for Algorithm Visualization”
submitted by Bhomik Tiwari, Animesh Verma, Devang Runwal, Aman Jaiswal has been
examined and is hereby approved towards partial fulfillment for the award of Bachelor
of Technology degree in Information Technology discipline, for which it has been
submitted. It understood that by this approval the undersigned do not necessarily
endorse or approve any statement made, opinion expressed or conclusion drawn there
in, but approve the project only for the purpose forwhich it has been submitted.

(Internal Examiner) (External Examiner)

Date: Date:
 GUIDE RECOMMENDATION

This is to certify that the work embodied in this project entitled “Improving Algorithm
Learning and Understanding through Interactive Visualizations: A Web-Based
Tool for Algorithm Visualization” submitted by Bhomik Tiwari, Animesh Verma,
Devang Runwal , Aman Jaiswal is a satisfactory account of the bonafide work done
under the supervision of Prof. Vishal Trivedi , is recommended towards partial
fulfillment forthe award of the Bachelor of Engineering (Information Technology)
degree by Rajiv Gandhi Proudyogiki Vishwavidhyalaya, Bhopal.

(Project Guide) (Project Coordinator)

 STUDENTS UNDERTAKING

This is to certify that project entitled “Improving Algorithm Learning and

Understanding through Interactive Visualizations: A Web-Based Tool for Algorithm

Visualization” has developed by us under the supervision of Prof. Ankita Agrawal.

The whole responsibility of work done in this project is ours .The sole intension ofthis

work is only for practical learning and research.

We further declare that to the best of our knowledge, this report does not containany

part of any work which has been submitted for the award of any degree either in this

University or in any other University / Deemed University without proper citation and

if the same work found then we are liable for explanation to this.

Aman Jaiswal(0827IT201015)
Animesh Verma (0827IT201020)
Bhomik Tiwari (0827IT201035)
Devang Runwal (0827IT201041)
 Acknowledgement

We thank the almighty Lord for giving me the strength and courage to sail out through the tough
and reach on shore safely.

There are number of people without whom this projects work would not have been feasible.
Their high academic standards and personal integrity provided me with continuous guidance
and support.

We owe a debt of sincere gratitude, deep sense of reverence and respect to our guide and mentor
Prof. Ankita Agrawal ,Professor, AITR, Indore for his motivation, sagacious guidance, constant
encouragement, vigilant supervision and valuable critical appreciation throughout thisproject
work, which helped us to successfully complete the project on time.

We express profound gratitude and heartfelt thanks to Prof .Prashant Lakkadwala , HOD IT,
AITR Indore for his support, suggestion and inspiration for carrying out this project. I am very
much thankful to other faculty and staff members of IT Dept, AITR Indore for providing me all
support, help and advice during the project. We would be failing in our duty if do not
acknowledge the support and guidance received from Dr S C Sharma, Director, AITR, Indore
whenever needed. We take opportunity to convey my regards to the management of Acropolis
Institute, Indore for extending academic and administrative support and providing me all
necessary facilities for project to achieve our objectives.

We are grateful to our parent and family members who have always loved and supported us
unconditionally. To all of them, we want to say “Thank you”, for being the best family that one
could ever have and without whom none of this would have been possible.
 Executive Summary

This project is submitted to Rajiv Gandhi Proudyogiki Vishwavidhyalaya, Bhopal (MP), India
for partial fulfillment of Bachelor of Engineering in Information Technology branch under the
sagacious guidance and vigilant supervision of Prof. Ankita Agra.wal.

The project is based on Algorithm visualization.

.
“Where the vision is one year,
cultivate flowers;
Where the vision is ten years,
cultivate trees;
Where the vision is eternity,
cultivate people.” -
Oriental Saying
 Table of contents

Chapter 1. Introduction
1
1.1 Overview
1
1.2 Background and Motivation
2
1.3 Problem Statement and Objectives
2
1.4 Scope of the Project
3
1.5 Group Organization
3
1.6 Report Structure
4

Chapter 2. Review of Literature

5
2.1 Preliminary Investigation
6
2.1.1 Limitations of the Project
7
2.2 Requirement Identification
7
2.4 Conclusion

Chapter 3 . Proposed System

8
3.1 Proposal
8
3.2 Benefits of Proposed System
 Block Diagram
9
Design Representations
10
Diagrams
13

Chapter 4 . Implementation
16
Technology Used
16
HTML
17
CSS
18
Javascript

ReactJs 19

Chapter 5 . Conclusion
20
Limitations
20
Suggestions and Recommendations
20
Bibliography
21
Guide Interaction sheet 21
 List of figures

Figure 1 - Block Diagram 19

Figure 2 - ER Diagram 21

Figure 3 – Use Case Diagram 23

 Chapter 1

Introduction

Algorithms play a vital role in computer science, serving as the fundamental building blocks for
many software programs and systems. However, understanding and visualizing how these
algorithms work can often be challenging, especially for beginners. This is where algorithm
visualizers come in – they provide an interactive and intuitive interface that makes it easier to
comprehend complex algorithms by visualizing their execution flow. The algorithm visualizer
will be designed to be user-friendly and accessible to all levels of users, from beginners to
advanced programmers. It will be useful for software developers, computer science students,
andeducators who want to learn and teach algorithms more effectively. The project will be
implemented using modern web technologies such as HTML, CSS, and JavaScript, making it easily
accessible and platform independent.

Overview

An algorithm visualizer is a software tool that helps users to better understand and visualize how
various algorithms work. It provides a user-friendly interface that displays the step-by-step
process of an algorithm, making it easier for users to comprehend and debug code. The tool
offers a range of features, such as visual representation of data structures, highlighting of key
code segments, and interactive control over the execution flow. Algorithm visualizers are used by
software developers, computer science students, and educators to improve their understanding
of algorithms and to teach them to others. This abstract provides an overview of the benefits and
features of algorithm visualizers and their applications in various fields.

Background and Motivation

Learning and teaching: Algorithms are a fundamental part of computer science and
programming, and they are often difficult to understand without visual aids. Algorithm
visualizers can make it easier for both students and teachers to learn and teach algorithms by
providing clear and interactive visualizations.

Accessibility: Not everyone has the same learning style or level of technical expertise. Algorithm
visualizers can help to make algorithms more accessible to a wider range of people, including those
who may struggle with more traditional text-based explanations.

Engagement: By making algorithms more interactive and visually appealing, algorithm

visualizers can increase user engagement and help to keep learners interested and motivated.

Debugging and optimization: Algorithm visualizers can also be useful tools for debugging and
optimizing algorithms. By visualizing the algorithm as it runs, developers can more easily
identify potential bugs and areas for improvement.
Problem Statement and Objectives

The problem addressed by the algorithm visualizer project is the difficulty of understanding and
visualizing complex algorithms. Algorithms serve as the fundamental building blocks of many
software programs and systems, but comprehending how they work can often be challenging,
especially for beginners. The traditional approach of studying algorithms through text-based
descriptions or dry theory can be daunting and ineffective for many students and programmers.
This can lead to frustration, errors, and slow progress in learning and applying algorithms.

Scope of the Project

The scope for algorithm visualizers is quite broad, as algorithms are used in many different fields
and applications. Here are some examples of areas where algorithm visualizers could be useful:

Education: Algorithm visualizers could be used in computer science classes at all levels, from
introductory programming courses to more advanced topics like data structures and algorithms.

Industry: Algorithm visualizers could be used in software development companies to help

developers understand and optimize complex algorithms used in applications such as data
analysis, machine learning, and artificial intelligence.

Research: Algorithm visualizers could be used by researchers studying algorithms in various

fields such as mathematics, physics, and engineering, to better understand and visualize the
algorithms they are working with.

Open-source projects: Algorithm visualizers could be useful tools for open-source projects,
where developers can use them to demonstrate how their algorithms work and encourage others
to contribute to the project.
Group Organization

● Bhomik Tiwari
I worked on front end and back end of the project. Documentation is also a
part of the work done by me in this project. I also organized and debug the
code of the project. Implementation logic for the project objective and coding
of internal functionalities is also done by me.

● Animesh Verma
I worked on front end and back end of the project. I investigated and found
the right technology and studied deep about it. I studied about the topic also
made some of the html templates.

● Devang Runwal
I worked on front end and back end of the project . I also organized and debug
the code of the project. Along with doing preliminary investigation and
understanding thedrawback of the current system I studied about the topic.

● Aman Jaiswal
I worked on front end and back end of the project. I also made the js code for
the search bar in this project. Implementation logic for the project objective
and coding of internal functionalities is also done by me.

Report Structure

The project Improving Algorithm Learning and Understanding through Interactive

Visualizations: A Web-Based Tool for Algorithm Visualization is primarily concerned
with the Algorithm visualization .

Chapter 1: Introduction- introduces the background of the problem followed by

rationale for the project undertaken. The chapter describes the objectives, scope and
applications of the project. Further, the chapter gives the details of team members
and their contribution in development of project which is then subsequently ended
with a report outline.

Chapter 2: Review of Literature- explores the work done in the area of Project
undertaken and discusses the limitations of existing system and highlights the
issues and challenges of project area. The chapter finally ends up with the
requirement identification for present project work based on findings drawn from
reviewed literature and end user interactions.
Chapter 3: Proposed System - starts with the project proposal based on requirement
identified, followed by benefits of the project. The chapter also illustrate software
engineering paradigm used along with different design representation. The chapter
also includes block diagram and details of major modules of the project. Chapter
also gives insights of different type of feasibility study carried out for the project
undertaken. Later it gives details of the different deployment requirements for the
developed project.

Chapter 4: Implementation - includes the details of different Technology/

Techniques/ Tools/ Programming Languages used in developing the Project. The
chapter also includes the different user interface designed in project along with
their functionality. Further it discuss the experiment results along with testing of
the project. The chapter ends with evaluation of project on different parameters like
accuracy and efficiency.

Chapter 5: Conclusion - Concludes with objective wise analysis of results and

limitation of present work which is then followed by suggestions and
recommendations for further improvement.
 Chapter 2

Review of Literature

Preliminary Investigation

A preliminary investigation is an essential step in the development of an algorithm visualizer.

This investigation involves identifying the target audience and their needs, determining the
scope of the project, researching existing tools and resources, defining the technical
requirements, and assessing the feasibility of the project. By conducting a thorough preliminary
investigation, the project team can gain a clear understanding of the project requirements and
feasibility, which is essential for successful development of the algorithm visualizer. Additionally,
the preliminary investigation can help to identify potential gaps or opportunities for
improvement, and to determine the most appropriate platforms, technologies, and programming
languages to use. Overall, a well-planned and executed preliminary investigation can greatly
increase the chances of success for the algorithm visualizer project.

Limitations of this Project

While algorithm visualizers offer many benefits, there are also some limitations to consider. Here
are some of the potential limitations:

1. Limited scope: Algorithm visualizers may only be applicable to certain algorithms or

programming languages, which limits their overall scope and usefulness.

2. Resource-intensive: Developing an algorithm visualizer may require significant

resources, including hardware, software, and development time, which could be a
limitation for some organizations or individuals.

3. Limited accessibility: While algorithm visualizers aim to make algorithms more

accessible, they may still require a certain level of technical knowledge and expertise to
use effectively.

4. Potential inaccuracies: Visualizing algorithms may simplify or abstract certain aspects

of the algorithm, which could potentially result in inaccuracies or misconceptions.

5. Technical complexity: Developing an algorithm visualizer can be technically complex

and require a high level of programming knowledge and expertise.
Requirement Identification

Functionality: The visualizer should accurately represent the algorithm being visualized and
allow users to interact with the algorithm in meaningful ways. This could include features such
as step-by-step execution, visualization of data structures, and customization options.

Usability: The visualizer should be intuitive and easy to use, even for users with limited
technical knowledge. This could involve designing a user-friendly interface, providing clear
documentation and tutorials, and incorporating user feedback into the design.

Compatibility: The visualizer should be compatible with a wide range of devices, browsers, and
operating systems, to ensure maximum accessibility for users.

Performance: The visualizer should be fast and responsive, even when dealing with large datasets
or complex algorithms. This could involve optimizing code for speed and efficiency, using caching
and other performance-enhancing techniques, and testing the visualizer under realistic conditions.

Security: The visualizer should be secure and protect user data and privacy. This could involve
using encryption, implementing secure login and authentication procedures, and following best.
 Chapter 3

Proposed System

Proposal

The proposed visualizer will be designed with the objective of making algorithms more
accessible to a wider range of users, regardless of their technical expertise. The visualizer will
provide an interactive and intuitive interface that allows users to observe the execution of
algorithms, visualize data structures, and customize the visualization options. The primary goal
of the visualizer is to improve understanding of algorithms, by providing visual representations
of the algorithms, making them easier to understand and comprehend. The visualizer will be
designed to support a wide range of algorithms and programming languages, and will be
compatible with a variety of devices and operating systems. The proposed visualizer will be
developed using the latest software development methodologies, tools, and technologies to
ensure optimal performance, security, and scalability. The project team will work closely with
users and stakeholders to gather feedback and ensure that the visualizer meets their needs and
requirements.

Benefits of the Proposed System

Improved accessibility: The visualizer will make algorithms more accessible to a wider range of
users, including those with limited technical expertise, by providing a user-friendly and interactive
interface.

Better understanding: The visualizer will improve understanding of algorithms by providing

visual representations of the algorithms, making them easier to understand and comprehend.

Customizability: The visualizer will allow users to customize the visualization and interaction
options to suit their specific needs and preferences, such as adjusting animation speed or selecting
which data structures to visualize.

Increased efficiency: The visualizer will help developers to identify and fix errors in algorithms
quickly, resulting in faster and more efficient development processes.

Enhanced collaboration: The visualizer will allow developers to collaborate more effectively by
providing a shared visual representation of the algorithm, making it easier to discuss and
identify issues.

Compatibility: The visualizer will be compatible with a wide range of devices and operating
systems, making it accessible to a large user base.
Block Diagram

The block diagram for an algorithm visualizer might include different components such as input
data, the algorithm being visualized, the visualization of the algorithm, the user interface, and the
output produced by the algorithm. The input data component represents the data that is being
fed into the algorithm, while the algorithm component represents the actual algorithm being
visualized. The visualization component displays the algorithm's execution in real-time, while the
user interface allows the user to interact with the algorithm and customize its execution. Finally,
the output component represents the results of the algorithm's execution.
Design Representations

1. HOME PAGE

2. PATHFINDER
3. N QUEEN

4. RECURSION TREE
5. SORTING
Diagrams

Er-Diagram:

The ER diagram for an algorithm visualizer might include entities such as users, algorithms,
visualizations, and input/output data. The users entity would represent the users of the
algorithm visualizer system. The algorithms entity would represent the algorithms that are
visualized in the system. The visualizations entity would represent the visualizations produced
by the system. The input/output data entity would represent the data that is input into the
algorithms and the output produced by the algorithms.

The relationships between these entities could be depicted using various symbols, such as lines
or arrows. For example, there might be a one-to-many relationship between the users entity and
the visualizations entity, indicating that a single user can create multiple visualizations.
Similarly,there might be a many-to-one relationship between the algorithms entity and the
visualizations entity, indicating that multiple visualizations can be produced from a single
algorithm.
Use-Case Diagram:

The use case diagram for an algorithm visualizer might include different actors and use cases.
Actors are the users or external systems that interact with the system, while use cases are the
specific tasks or actions that the system can perform for the users.

For example, the actors in an algorithm visualizer system might include a data scientist, a
software engineer, and a computer science student. The use cases might include actions such
as visualizing a sorting algorithm, modifying the visualization parameters, saving a
visualization, and sharing a visualization with others.

The use case diagram would depict these actors and use cases using symbols such as ovals and
rectangles. The actors would be depicted using ovals, while the use cases would be depicted
using rectangles. Lines or arrows would be used to indicate the different interactions between
the actors and the use cases.
 Chapter 4

Implementation

An algorithm visualizer is a software tool that helps users to better understand and visualize
how various algorithms work. It provides a user-friendly interface that displays the step-by-step
process of an algorithm, making it easier for users to comprehend and debug code. The tool
offers a range of features, such as visual representation of data structures, highlighting of key
code segments, and interactive control over the execution flow.

Technology Used

● HTML

HTML stands for Hypertext Markup Language, and it is the most widely used language
to write Web Pages. Hypertext refers to the way in which Web pages (HTML
documents) are linked together. Thus, the link available on a webpage is called
Hypertext. As its name suggests, HTML is a Markup Language which means you use
HTML to simply "mark-up" a text document with tags that tell a Web browser how
to structure it to display. Originally, HTML was developed with the intent of defining
the structure of documents like headings, paragraphs, lists, and so forth to facilitate
the sharing of scientific information between researchers. Now, HTML is being
widely used to format web pages with the help of different tags available in HTML
language.
  CSS

Cascading Style Sheets (CSS) is a stylesheet language used to describe the presentation of a
document written in HTML or XML (including XML dialects such as SVG, MathML or XHTML).
CSS describes how elements should be rendered on screen, on paper, in speech, or on other
media. CSS is among the core languages of the open web and is standardized across Web
browsers according to W3C specifications. Previously, the development of various parts of CSS
specification was done synchronously, which allowed the versioning of the latest
recommendations. You might have heard about CSS1, CSS2.1, or even CSS3. There will never
be a CSS3 or a CSS4; rather, everything is now CSS without a version number. After CSS 2.1, the
scope of the specification increased significantly and the progress on different CSS modules
started to differ so much, that it became more effective to develop and release recommendations
separatelyper module. Instead of versioning the CSS specification, W3C nowperiodically takes
a snapshot of the latest stable state of the CSS specification and individual modules progress.
CSS modules now have version numbers, or levels, such as CSS Color Module Level 5.
 ● Javascript
JavaScript (often shortened to JS) is a lightweight, interpreted, object-oriented language with
first-class functions, and is best known as the scripting language for Web pages, butit's used in
many non-browser environments as well. It is a prototype-based, multi- paradigm scripting
language that is dynamic, and supports object-oriented, imperative, and functional
programming styles. JavaScript runs on the client side of the web, which can be used to design
/ program how the web pages behave on the occurrence of an event. JavaScript is an easy to learn
and also powerful scripting language, widely used for controlling web page behavior. Contrary to
popular misconception, JavaScript is not "Interpreted Java". In a nutshell, JavaScript is a dynamic
scripting language supporting prototype based object construction. The basic syntax is
intentionally similar to both Java and C++ to reduce the number of new conceptsrequired to
learn the language. Language constructs, such as if statements, for and while loops, and switch
and try ... catch blocks function the same as in these languages (or nearly so). JavaScript can
function as both a procedural and an object oriented language. Objects are created
programmatically in JavaScript, by attaching methods and properties to otherwise empty
objects at run time, as opposed to the syntactic class definitions common in compiled languages
like C++ and Java. Once an object has been constructed it can be used as a blueprint (or
prototype) for creating similar objects.
  Reactjs
Reactjs is a JavaScript library that allows us to create user interfaces for web applications. Reactjs
is based on the concept of components, which are reusable pieces of code that can render UI
elements, handle user interactions, and manage state. Reactjs uses a declarative approach to
describe how the UI should look and behave, and a virtual DOM to efficiently update the UI when
the data changes. Reactjs also supports JSX, which is a syntax extension that allows us to write
HTML-like code in JavaScript.Reactjs is one of the most popular and widely used front-end
frameworks in the web development industry. Reactjs can help us to create fast, responsive, and
dynamic web applications that can run on various devices and platforms. Reactjs also has a large
and active community that provides many resources, such as tutorials, documentation, tools, and
libraries.Reactjs is a JavaScript library that creates user interfaces for web applications. Reactjs
uses components, declarative syntax, virtual DOM, and JSX to make UI development easy and
efficient. Reactjs is popular and widely used, and has many resources and libraries available. To
start with Reactjs, we can use the create-react-app tool to set up a React environment on our
computer.
 Chapter 5.Conclusion
Conclusion

The algorithm visualizer is a powerful tool that has revolutionized the way algorithms are
taught, learned, and applied. It provides a visual representation of complex algorithms, making
them more accessible and understandable to learners and practitioners alike. By using an
algorithm visualizer, users can interactively observe the step-by-step execution of algorithms,
understand their inner workings, and identify potential optimizations or issues.
One of the primary advantages of algorithm visualizers is that they enable users to gain a deeper
understanding of how different algorithms work and how they process data. Instead of just
reading or listening to a description of an algorithm, users can see it in action, visualize its
flow, and explore its behavior on different inputs. This makes learning and understanding
algorithms more engaging, interactive, and effective, especially for those who are visual
learners or struggle with abstract concepts.
Moreover, algorithm visualizers can be used for educational purposes, both in traditional
classroom settings and online learning environments. They provide students with a dynamic
and interactive learning experience that fosters curiosity, creativity, and problem-solving
skills. Teachers can use algorithm visualizers to illustrate key concepts, demonstrate different
algorithms, and engage students in hands-on activities that enhance their understanding and
retention of the material.
In addition to educational benefits, algorithm visualizers also offer practical advantages for
software developers, data scientists, and researchers. They can be used to debug and optimize
algorithms, visualize their performance on large datasets, and compare the efficiency of
different algorithms on specific tasks. This can help developers to identify bottlenecks,
improve the accuracy and speed of their algorithms, and ultimately produce better software
products and data analysis results.
Overall, algorithm visualizers have become an essential tool in the field of computer science
and beyond. They enable users to gain a deeper understanding of algorithms, enhance their
problem-solving skills, and improve the quality of their software products and research
outcomes. Whether for educational, research, or practical purposes, algorithm visualizers are
an invaluable asset that can help users to unlock the full potential of algorithms and advance
their knowledge and skills in the field of computer science.
 Limitations
Limited scope: Algorithm visualizers may not cover all aspects or variations of an algorithm. They
usually focus on illustrating the basic steps and flow of an algorithm, but may not account for every
possible input or scenario.

Simplification: To make algorithms more understandable, visualizers may simplify some of the
complex details or edge cases. This can lead to an oversimplification of the algorithm, and may
not accurately represent its behavior in real-world applications.

Dependence on technology: Algorithm visualizers rely on technology and may not be

accessible to all learners or practitioners. Some users may not have access to the necessary
hardware or software to run the visualizer, or may have limitations due to internet connectivity
or device compatibility.

Lack of interactivity: Some algorithm visualizers may not provide enough interactivity to fully
engage learners or allow them to explore different inputs or scenarios. Users may be limited to
predefined inputs or have limited control over the execution of the algorithm.

Overemphasis on visuals: While visuals can be a helpful aid, over-reliance on algorithm

visualizers can detract from developing a deep understanding of the underlying algorithms.
Users may become too focused on the visuals and lose sight of the underlying logic and concepts.

Suggestion and Recommendations for Future Work

Greater coverage: Future algorithm visualizers could cover a wider range of algorithms, including
more advanced or specialized algorithms. This would provide learners and practitioners with a
more comprehensive understanding of algorithms and their applications.

More interactivity: To engage learners more effectively, future algorithm visualizers could
provide greater interactivity and control, enabling users to experiment with different inputs,
modify algorithms, and see the results of their changes in real-time.

Accessibility improvements: Algorithm visualizers could be made more accessible to users

with different needs, such as those with disabilities, limited connectivity, or limited hardware.
This could be achieved by optimizing visualizers for low-bandwidth connections or developing
mobile- friendly versions of visualizers.

Integration with learning management systems: Algorithm visualizers could be integrated

with learning management systems (LMS) to provide teachers with insights into how their
students are using the visualizer and which concepts they are struggling with.
Collaboration and sharing: Future algorithm visualizers could incorporate features that allow
users to collaborate on algorithms, share their visualizations with others, and provide feedback
or suggestions. This would enable learners and practitioners to work together more effectively
and foster a community of learning and collaboration.

Integration with code editors: Algorithm visualizers could be integrated with code editors to
provide a more seamless learning experience, allowing users to experiment with algorithms
directly in the code editor and see the results of their changes in real-time.
 Bibliography

 Aggarwal, A., Gupta, A., & Singh, S. (2021). Algorithm Visualizer: Its features and
working. In 2021 IEEE 8th Uttar Pradesh Section International Conference on
Electrical, Electronics and Computer Engineering (UPCON) (pp. 1-6). IEEE.
 Demetrescu, C., Finocchi, I., Italiano, G. F., & Nä her, S. (2002). Visualization
techniques for algorithm engineering. In Encyclopedia of Algorithms (pp. 1-5).
Springer.
 Hundhausen, C., Douglas, S., & Stasko, J. (2002). Algorithm visualization: a report on
the state of the field. ACM SIGCSE Bulletin, 34(4), 150-154.
 Shaffer, C. A., Cooper, M., & Alon, A. J. (2010). Algorithm visualization: The state of
the field. ACM Transactions on Computing Education (TOCE), 10(3), 1-22.
 Brown, M. H., & Sedgewick, R. (1985). Techniques for algorithm animation. IEEE
software, 2(1), 28-39.
 Stasko, J., Domingue, J., Brown, M. H., & Price, B. (1998). Software visualization:
programming as a multimedia experience. MIT press.
 Brown, M. H., & Sedgewick, R. (1985). Techniques for algorithm animation. IEEE
software, 2(1), 28-39.