Skip to content

This Python-based tool implements and analyzes five fundamental sorting and search algorithms: Bubble Sort, Merge Sort, Quick Sort, Radix Sort, and Linear Search. It allows users to compare the performance of these algorithms in terms of time complexity across different input sizes.

Notifications You must be signed in to change notification settings

michaelcsuf/335-Project_1

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

38 Commits
 
 
 
 
 
 
 
 

Repository files navigation

SORTHING VISUALIZATION


Untitled design

This is a gui that analysis different sorting algorithmns and as well as linear search.

Functionality:

  • This is a gui that has single array input, multiple array input,
  • randomizer settings input with: Min value (input), Max value (input), Num of elements(input) then generate button

Algorithm Implementation:

Implement five sorting algorithms in Python:

  • Bubble Sort

  • Merge Sort

  • Selection Sort

  • Quick Sort

  • Radix Sort

  • Linear Search Algorithm.

Project Setup

Install packages

  • pip install tkinter
  • pip install matplotlib

To Run

  • Press play button on vscode or python GUI.py in the terminal

About

This Python-based tool implements and analyzes five fundamental sorting and search algorithms: Bubble Sort, Merge Sort, Quick Sort, Radix Sort, and Linear Search. It allows users to compare the performance of these algorithms in terms of time complexity across different input sizes.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •  

Languages