Small Project to practice what we have learned about kind of array organizers. In this simple project made all by JavaScript (using react library).
The lower bound for Comparison based sorting algorithm (Merge Sort, Heap Sort, Quick-Sort .. etc) is Ω(nLogn), i.e., they cannot do better than nLogn. Counting sort is a linear time sorting algorithm that sort in O(n+k) time when elements are in range from 1 to k.
This project uses:
- React - Library.
- JavaScript - and a touch of pure JavaScript.
It requires React Library.
Clone the project, install the dependencies and start the server.
If you have got NodeJS installed then, execute the codes below!. If you don't (what you are doing with your life?), install it first.
$ git clone [email protected]:lucasgbriell/radix-sort.git
$ npm install
$ npm startAnd be happy :D.
- Elias Reis
- Lucas Gabriel