AlgorandSIMULATION v1.0
Sequential Engines(17)
Parallel Engines
Quick Sort
sequentialRAMA divide-and-conquer algorithm that partitions an array around a pivot element, placing smaller items before it and larger items after, then recursively sorting the sub-arrays.
SIMULATION STEP PROGRESSStep 1 / 1
SPEED (50%)
SIZE (8)
💡 Tip: Enter integers between 1 and 99. Max size is 16.
Code Workspace
1procedure quickSort(A, low, high)
2 if low < high then
3 p := partition(A, low, high)
4 quickSort(A, low, p - 1)
5 quickSort(A, p + 1, high)
6 end if
7end procedure
8procedure partition(A, low, high)
9 pivot := A[high]
10 i := low - 1
11 for j := low to high-1 do
12 if A[j] < pivot then
13 i := i + 1
14 swap(A[i], A[j])
15 end if
16 end for
17 swap(A[i + 1], A[high])
18 return i + 1
19end procedure
Currently highlights executing branch
RUNTIME COST METRICS
Comparisons0
Memory Writes0
Memory Reads0
Elements Swapped0
Computational Model:RAM (Single Core)
Theoretical Bound:O(N log N) avg
Space Complexity:O(log N) stack
Communication Cost:0 (Shared Bus)
THEORETICAL ANALYSIS & RESEARCH
Conceptual Focus: A divide-and-conquer algorithm that partitions an array around a pivot element, placing smaller items before it and larger items after, then recursively sorting the sub-arrays.
Real-world Industrial Applications:
- Standard template library sorts in C/C++
- Embedded systems where space is at a premium