Scribd
Upload
24 views7 pages

Interactive Sorting Algorithm Visualizer

The document presents a project overview for a Sorting Visualizer tool developed in C programming, aimed at demonstrating various sorting algorithms interactively. Key features include real-time graphical representations, comparative efficiency analysis, and a modular design for adding new algorithms. Implemented algorithms include Selection Sort, Insertion Sort, Bubble Sort, Merge Sort, and Quick Sort, each with specified time complexities and visual characteristics.

Uploaded by

developrr.sourabh
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views7 pages

Interactive Sorting Algorithm Visualizer

The document presents a project overview for a Sorting Visualizer tool developed in C programming, aimed at demonstrating various sorting algorithms interactively. Key features include real-time graphical representations, comparative efficiency analysis, and a modular design for adding new algorithms. Implemented algorithms include Selection Sort, Insertion Sort, Bubble Sort, Merge Sort, and Quick Sort, each with specified time complexities and visual characteristics.

Uploaded by

developrr.sourabh
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

PRESENTED BY

SUBJECT Introduction to Programming & Problem Solving


ABHIDEEPTA
SUBJECT CODE MC460102 BHAWESH
SUBJECT TEACHER Dr. PAMMI KUMARI SOURABH
ASHISH
Project Overview – Sorting VisualiZer

 Objective:
To develop an interactive tool that visually demonstrates the working of various
sorting algorithms using C programming.

 Key Features:
1. Real-time graphical representation of sorting steps
2. Comparative understanding of algorithm efficiency
3. Modular design for easy addition of new algorithms

 Technologies Used:
1. Language: C
2. Graphics Library: (e.g. custom console-based visuals)
3. Data Structures: Arrays, recursion (for merge/quick sort)
Implemented Sorting Algorithm
Algorithm Time Complexity Visual Characteristics
(Best/Average/Worst)

Selection Sort O(n²) / O(n²) / O(n²) Highlights minimum


selection

Insertion Sort O(n) / O(n²) / O(n²) Builds sorted array


incrementally

Bubble Sort O(n) / O(n²) / O(n²) Repeated swaps, intuitive


flow

Merge Sort O(n log n) / O(n log n) / Divide and conquer, smooth
O(n log n) merging

Quick Sort O(n log n) / O(n log n) / Pivot-based partitioning


O(n²)
MATHEMATICAL REPRESENTATION OF
GROWTH OF FUNCTION

n O(n) O(n log n) O(n²) O(n³)

5 × log 5
5 5 2 25 125
≈ 11.61

10 × log 10
10 10 2 100 1000
≈ 33.22

20 × log 20
20 20 2 400 8000
≈ 86.44

50 × log 50
50 50 2 2500 125000
≈ 282.19
GRAPHICAL REPRESNTATION OF
GROWTH OF FUNCTION
EXAMPLE OF VISUALIZATION OF
MERGE SORT
THANK YOU

You might also like