The purpose behind this project is to provide implementations for various common sorting algorithms in computer science. In addition to providing implementation details, another goal is to provide enough documentation for students to learn and understand how these sorting algorithms work.
For now, the sorting algorithms included in this project are:
- Selection Sort ( O(n^2) )
- Bubble Sort ( O(n^2) )
- Insertion Sort ( O(n^2) )
- Merge Sort ( O(n * log(n)) )
- Quick Sort ( O(n * log(n)) )
- JavaScript
- Ruby
- Include the 'javascript/sorting-algorithms.js' file in your application.
- By including the above file, the object '_sa' will be available in the global environment.