BIMSQ Sort Visualizer
BIMSQ is an abbreviation for Bubble Sort, Insertion Sort, Merge Sort, Selection Sort, and Quick Sort.
Explanations
Bubble Sort
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity is quite high.
Step
In Bubble Sort algorithm, • traverse from left and compare adjacent elements and the higher one is placed at right side. • In this way, the largest element is moved to the rightmost end at first. • This process is then continued to find the second largest and place it and so on until the data is sorted.
Complexity
Best: Ω(n)Average: θ(n^2)Worst: O(n^2)Space: O(1)
Insertion Sort
Insertion sort is a simple sorting algorithm that works similar 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.
Step
To sort an array of size N in ascending order, • iterate over the array and compare the current element (key) to its predecessor, • if the key element is smaller than its predecessor, compare it to the elements before. • Move the greater elements one position up to make space for the swapped element.
Complexity
Best: Ω(n)Average: θ(n^2)Worst: O(n^2)Space: O(1)
Merge Sort
Merge sort is defined as a sorting algorithm that works by dividing an array into smaller subarrays, sorting each subarray, and then merging the sorted subarrays back together to form the final sorted array.
Step
• Initially divide the array into two equal halves. • These subarrays are further divided into two halves. Then they become array of unit length that can no longer be divided and array of unit length are always sorted. • The sorted subarrays are merged together, and we get bigger sorted subarrays. • This merging process is continued until the sorted array is built from the smaller subarrays.
Complexity
Best: Ω(n log(n))Average: θ(n log(n))Worst: O(n log(n))Space: O(n)
Selection Sort
Selection sort is a simple and efficient sorting algorithm that works by repeatedly selecting the smallest (or largest) element from the unsorted portion of the list and moving it to the sorted portion of the list.
Step
To perform selection sort on an array of size N: • Iterate from the beginning of the array to the second-to-last element. • Find the minimum element in the unsorted portion of the array. • Swap the minimum element with the first element in the unsorted portion. • Move the boundary between the sorted and unsorted portions one element to the right. • Repeat the above steps until the entire array is sorted.
Complexity
Best: Ω(n^2)Average: θ(n^2)Worst: O(n^2)Space: O(1)
Quick Sort
QuickSort is a sorting algorithm based on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.
Step
To perform Quick Sort on an array of size N: • Choose an element from the array as the pivot. • Partition the array into two sub-arrays, with elements less than the pivot in one sub-array and elements greater than the pivot in the other sub-array. • Recursively apply Quick Sort to the sub-arrays. • Combine the sorted sub-arrays and the pivot to obtain the final sorted array.
Complexity
Best: Ω(n log(n))Average: θ(n log(n))Worst: O(n^2)Space: O(log(n))
Our People
Reynaldo Marchell Bagas Adji
“Life is not a game of luck. If you wanna win, work hard.”
Developer
Ihsaan Hardyanto
“if you cannot do great things, do small things in a great way.”
Developer
Sessario Ammar Wibowo
“Life is hard but definitely could get harder. Start coding today.”
Researcher
William Prasetyo
“Every journey begins with a single step. We just have to have patience.”
UI/UX Designer
Richard Yohanes
“Great things never come from comfort zones.”
UI/UX Designer
About This Project
We created the BIMSQ Sort Visualizer to fulfill the final assignment for the Algorithm Design and Analysis course. This project was created with the aim of displaying a visualization of the five sorting algorithms that we often use, namely Bubble Sort, Insertion Sort, Merge Sort, Selection Sort, and Quick Sort.
BIMSQ Sort Visualizer
Made with ❤️ by Kelompok 1