|
Abstract Sorting Algorithms
|
| There are an infinite amount of abstract sorting algorithms. An abstract sorting algorithm is defined as an algorithm used to sort an Array of elements, in an order determined by the algorithm. In most cases, a sorting algorithm is particularly useful to a computer scientist, where the algorithm takes an array of integers, and returns a sorted array of integers. In an abstract sorting algorithm, the array is sorted in some, often comical, way that is not practical or has a very unique run-time equation. Usually, an abstract algorithm's run time may have a worst case of infinite time, or sometimes a very specific amount, not requiring the use of 'n'. |
| < Prev | Next > |
|---|
Main Menu
| Home |
| Articles |
| Search |
| Submit Article |
| Contact Us |
| Donate to Wikibin |
