Technologies β’ Getting Started β’ Team Members
A Java program that implements bucket-based radix sort for sorting numbers and words, with complexity analysis through primitive operation counting and Excel graph plotting.
πPreview the Graph for Complexity Analysis
- Java
- Microsoft Excel (for plotting graphs)
- Git (for version control)
- IntelliJ IDEA
- Eclipse
- Visual Studio Code
Follow these instructions to run the project locally.
Ensure you have the following installed:
- Java JDK 17+
- Git
- A Java IDE (e.g. IntelliJ)
Clone the project repository:
git clone https://github.com/Some0ne11/cpt212-sorting-algo.gitCompile and run the sorting programs from your IDE or terminal:
# For numeric sorting
javac Sorting.java
java Sorting
# For word sorting
javac WordSorting.java
java WordSorting
# For complexity analysis with counter
javac SortingCounter.java
java SortingCounter
javac WordSortingCounter.java
java WordSortingCounterSortingCounter.javaandWordSortingCounter.javaare modified versions that count primitive operations.- Collected data is analyzed and visualized using Microsoft Excel to observe time complexity trends.
- Graphs include:
- Number of operations, T(n) vs input size, n for Number Sort
- Number of operations, T(n) vs input size, n for Word Sort
Special thanks to all contributors of this project.
|
Muhammad Ammar Danial (22301793) |
Ng Xuan Hern (22304061) |
Low Yvonne (22305530) |
π Feel free to fork, contribute, or raise issues to improve this algorithm.

