To Study Different Sorting Techniques and Pathfinding

Abstract –

Sorting Visualizers are tools that help you understand how sorting algorithms work. They visually
represent the steps involved in sorting a list of items, making it easier to grasp the underlying
concepts.There are many different types of Sorting Visualizers, each with its own unique features
and capabilities. Some common features include:Support for multiple sorting algorithms: Most
visualizers support a variety of sorting algorithms, such as bubble sort, insertion sort, selection sort,
merge sort, and quicksort.Interactive controls: Visualizers often allow you to control the speed of the
visualization, pause and resume the sorting process, and even step through the algorithm one step
at a time. Customizable data: Some visualizers allow you to input your own data to be sorted, while
others generate random data for you. Different visualization styles: Visualizers may use different
graphical representations to show the sorting process, such as bar charts, line graphs, or scatter
plots.Sorting Visualizers can be used for a variety of purposes, such as:Educational: They can be a
great way to learn about sorting algorithms and how they work. Debugging: They can help you
identify problems in your own sorting implementations. Performance analysis: They can be used to
compare the performance of different sorting algorithms.

If you’re interested in learning more about Sorting Visualizers, there are many resources available
online. You can find tutorials, articles, and even interactive visualizers that you can use to explore
different sorting algorithms
Introduction

Algorithm Visualizer is an interactive online platform design to visualize the algorithms

through a visualization.
It aims to help students, teachers, and professionals understand various algorithms by
visualizing code.

Start
1. Enter the choice which technique you want to work on for that enter 1 for Bubble sort 2
for Insertion sort and 3 for Selection sort
2. As you enter the choice the sort technique will work and after that again it asks whether
do you want to continue if yes enter choice of technique on which you want to work or
enter no to exit

Lets understand the techniques in - deep

1. Bubble Sort -
Bubble Sort is the simplest sorting technique that works by repeatedly swapping
the adjacent elements if they are in the wrong order. This is not suitable for large data
sets as its average and worst-case time complexity is quite high.

Algorithm of Bubble Sort -

1. Start
2. Initiate two values n as size of array, also i and j to traverse array.
3. Put i=0 and j=1.
4. While traversing if array[i] > array[j] swap both the numbers.
5. Increment the value i and j then go to Step 3.
6. If the value of i > n-1 and j > n and n>1 then
 n=n-1
 go to Step 2
7. Exit
Flowchart of Bubble Sort -

Example of Bubble Sort –

Step 1:

Given, array: [ 9,8,6,3], traverse from pos=1 till pos=4 and swap the number with the previous
element if it is less than the previous element

First Traverse

9 8 6 3

8 9 6 3

8 6 9 3

8 6 3 9
Step 2:

Repeat the previous Step for pos=1 to pos=3

 Second Traverse

8 6 9 3

6 8 3 9

6 3 8 9

Step 3:

Follow Step 1 for pos=1 to pos=2

Third Traverse

6 3 8 9

3 6 8 9

Step 4:

As now pos=1 to pos=1 means the array is now fully sorted

Result
3 6 8 9

2. Insertion Sort –
Insertion sort is a simple sorting technique that works similarly to the way you sort playing
cards in your hands. The array is virtually split into a sorted and an unsorted part. Values
from the unsorted part are picked and placed at the correct position in the sorted part.

Algorithm of Insertion Sort –

1. Variable declared i=1

2. Traverse the Array till i<N
If arr[i]<arr[i-1] then arr[j]=value present after shifting the elements of the array from j to i-1.
3. Return the Sorted Array.

Flowchart of Insertion Sort -

Example of Insertion Sort –

Given, array[13,12,14,6,7]

Array 13 12 14 6 7

Shift 13 12 14 6 7

Shift 12 13 14 6 7

Shift 6 12 13 14 7

Result 6 7 12 13 14

3. Quick Sort –

Quicksort is a sorting algorithm that is based on the divide-and-conquer paradigm. It is one of the
most efficient sorting algorithms and is used in many applications.

1.Choose a pivot element from the array.

2.Partition the array into two sub-arrays:
3. Elements less than the pivot
4. Elements greater than or equal to the pivot
5.Recursively sort the two sub-arrays.
Flowchart of Quick Sort -
Conclusion –

• In conclusion, an algorithm visualizer is a powerful educational tool that enhances the

understanding of complex algorithms through interactive and engaging visualizations.

• Its user-friendly interface, flexible customization options, and open-source availability

make it a valuable resource for students, educators, software developers, and
researchers.

• By providing step-by-step execution, speed control, and the ability to input custom data
sets, it allows users to explore and learn algorithms in a hands-on manner.