現在この提出コンテンツをフォロー中です。
- フォローしているコンテンツ フィードに更新が表示されます。
- コミュニケーション基本設定に応じて電子メールを受け取ることができます
Calculate, quantify, and visualize the run times of sorting algorithms across a variety of input conditions.
Select from built-in sorting algorithms or add your own, choose the type of data to sort, specify array lengths, and define how many arrays to test at each size. The app executes each algorithm on identical inputs and plots the resulting run-time performance for direct comparison. Curve fits are also generated and displayed to help analyze time complexity trends.
Custom algorithms can be added to the +sortingMethods subfolder and made available within the app by clicking “Update.”
To use:
1) Install app or run .mlapp file
2) Select sorting functions to analyze
3) Click Run
4) To edit & expand sorting functions - click "Open sorting folder" edit files (if you make a new file click "Update")
5) Change what type of data are to be sorted under "Data to sort" - Sorting data can be plotted with the "Plot" button.
6) Change how long of arrays to sort under "Array lengths"
7) Change how many of each array length to sort with "N tests per length"
All feedback welcome - enjoy!!
引用
Chris Wilkening (2026). Test Sorting Functions (https://jp.mathworks.com/matlabcentral/fileexchange/183879-test-sorting-functions), MATLAB Central File Exchange. に取得済み.
