이 프로젝트는 KSA 자료구조 수업 - 정렬 알고리즘 시뮬레이터 개발 숙제를 위해 진행되었습니다.
정렬 알고리즘의 시각적, 청각적 표현을 통한 심화적 학습을 목적으로 제작되었습니다.
- Bubble Sort (Info)
- Insertion Sort (Info)
- Selection Sort (Info)
- Quick Sort (First Index Pivot, Last Index Pivot) (Info)
- Merge Sort (Info)
- Radix Sort (LSD) (Info)
- Shell Sort (Info)
- Comb Sort (Info)
- Heap Sort (Info)
- Tim Sort (Merge + Insertion) (Info)
- Intro Sort (Quick + Heap + Insertion) (Info)
- Counting Sort (Info)
- Gnome Sort (Stupid Sort) (Info)
- Odd-Even Sort (Info)
- Cocktail Sort (Info)
- Bogo Sort (Info)
- Adaptive Partition Sort (APS, Quick + Merge + Insertion) (Info)
- Sorted : Ascending Integer Array
- Random : Distinct Random Integer Array
- Reversed : Descending Integer Array
- Almost Sorted : Ascending Integer Array with Some Errors (err = lg(length**2))
- White (#FFFFFF) : Indexes in Sorting
- Gray (#969696) : Out of Partition
- Red (#d64747) : Indexes in Comparing or Processing
- Blue (#47cdd6) : Pivot Index
- Green (#8fd647) : Sort Checking
This program was developed with PyQt