Sorting algorithm
A sorting algorithm is an algorithm that puts the elements of a collection into a certain order. Most commonly, numbers are sorted by their value, and words are…

A sorting algorithm is an algorithm that puts the elements of a collection into a certain order. Most commonly, numbers are sorted by their value, and words are sorted by their alphabetical order (as they would appear in a dictionary or phone book). Efficient sorting is important for other things: finding an element in a sorted collection is easier, and merging a new element may also be easier if the collection is sorted.
Note that not all sorting algorithms can be applied in all cases. An example might be that the records can only be read one after another (sequentially); they might be stored on a tape.
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.