Search_v1: Search for 1 item with time taken details includedSearch_v2: Automated search for all values within array, returning performance visualisation between different search algorithmsSort_v1: Sort an customise array and return bar chart visualisationSort_v2: Sort an array with the minimum length of 1 to the specified maximum array length
Python 3.6 or above
pythonorpython3in terminal to check the version
-
Windows only: Execute start.bat -
Manually through system terminal with
pip install package(e.g.pip install pandas)
| numpy | ipython | matplotlib | pandas | |
|---|---|---|---|---|
| Search_v1 | 🟢 | 🟢 | ⚪ | ⚪ |
| Search_v2 | 🟢 | 🟢 | 🟢 | 🟢 |
| Sort_v1 | 🟢 | 🟢 | 🟢 | ⚪ |
| Sort_v2 | 🟢 | 🟢 | 🟢 | ⚪ |
-
.ipynbis the recommended format, to be used in environments that allow Jupyter Notebook execution -
.py-
Direct execution through
pythonorpython3 -
Execute
start.batand select version.
Batch script
start.batis case sensitive -
Check releases for more details
Linear Search is not time-efficient, adjust the parameters wisely
Sorting is not time-efficient, adjust the parameters wisely
- Bubble sort (Unoptimized) -- 4 times longer than Insertion Sort
- Bubble sort (Optimized) -- 2 times longer than Insertion Sort
- In
Sort_v2, the recommend upper limit is 1000 as higher parameters would led to long execution time,turning your computer into a jet engineslowing other processes within your computer
| File | Search_v1 | Search_v2 | Sort_v1 | Sort_v2 |
|---|---|---|---|---|
| Demo | Deepnote | Deepnote | Deepnote | Deepnote |
| Execution time (Demo) | < 1 min | 40 min | 70 min | 12.5 hours |
| Notes | Duplicates: 4884 Values Remain: 95116 Seed: 1 Number: 3620 |
Duplicates: 4733 Values Remain: 95267 Seed: 1698699006 |
Seed: 1440114639 Array Length: 41001 |
Seed: 1355045386 Upper Limit: 5000 |
Deepnote, Replit, Datalore (from JetBrains), Google Colab, Binder
More sites here StackOverflow Answer