Due date:2025/03/05 (Wed.) 23:30 遲交三天以上不收件!
1. Input: integers n (for data size) and range (for the range of randomly generated integers)
2. Randomly generate n integers ranging in [0, range-1] or [1, range]
3. Enable or disable for printing out the n random numbers
4 Sort the n random integers
4.1 by Selection sort
4.2 by Bubble sort
5 Search a certain target among the sorted integers
6. Acquire the CPU times spent by Selection/Bubble/(Quick) sorts (or other sorting algorithms), respectively
7. Compare the CPU running times in 6 using Excel or other tools (see the following examples)
1. 有 input 合理性檢測 (只能輸入數字,輸入其它字元會跳出警告...等)
2. 程式註解
3. 是否輸出排序結果可選擇、自動檢測排序結果是否正確...
4. CPU time 的更精準的輸出 (小數點給位...等)
5. 更多的排序方法 ( 如:quicksort, ... )
5. 簡潔美觀的 user interface
6. 由程式繪製圖表
7. 其它...
34 (mins) Debugging steps included (Sep. 2024)
(Old version, just skip this video.) 63 (mins) Debugging steps included
12 (mins)
Better GUI (12:12)
For more about the sorting performance evaluation of sorting algorithms, please refer to :
Below are in VS C++ 2010