To contribute:
- To start adding any algorithm,
- Pick any algo from the list of algorithms in not implemented
How it works:
- The sorting function takes in array of random numbers, provided by framework.
- Store the array when you swap numbers along with indexes to a changes array and return it.
- The framework will pick up and play it in sequence.
- Once you have the method ready, jump to src/algorithms/SortingAlgorithmUtil.js
- There you can integrate your function with the framework.
To begin with:
- Jump to Selection Sort
- simplest method.
Build
- clone repo
- npm install
- npm start
Deployment
- Using netlify.
- Changes pushed to master will be deployed automatically.
To Do.
- 🕒 In Progress.
- ✅ finished implementing
- Selection Sort ✅
- Insertion Sort ✅
- Merge Sort ✅
- Bubble Sort ✅ icoder18
- Shell Sort ✅ icoder18
- Heap Sort 🕒
- Binary Insertion Sort
- Gnome Sort ✅ tavsec
- Quick Sort (LR ptrs)
- Quick Sort (LL ptrs)
- Quick Sort (ternary, LR ptrs)
- Quick Sort (ternary, LL ptrs)
- Quick Sort (dual pivot)
- Cocktail Shaker Sort
- Comb Sort
- Smooth Sort
- Odd-Even Sort
- Bitonic Sort
- Cycle Sort
- Radix Sort (LSD)
- Radix Sort (MSD)
- std::sort (gcc)
- Tim Sort
- Block Merge Sort (WikiSort)