Sorting algorithm
In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output. Formally, the output of any sorting algorithm must satisfy two conditions:
- Comment
- enIn computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output. Formally, the output of any sorting algorithm must satisfy two conditions:
- Date
- enJune 2021
- enNovember 2015
- 3 March 2015
- Depiction
- Has abstract
- enIn computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output. Formally, the output of any sorting algorithm must satisfy two conditions: 1. * The output is in monotonic order (each element is no smaller/larger than the previous element, according to the required order). 2. * The output is a permutation (a reordering, yet retaining all of the original elements) of the input. For optimum efficiency, the input data should be stored in a data structure which allows random access rather than one that allows only sequential access.
- Hypernym
- Algorithm
- Is primary topic of
- Sorting algorithm
- Label
- enSorting algorithm
- Link from a Wikipage to an external page
- archive.org/details/computationalpro00actu/page/101
- oeis.org/A036604
- www.iti.fh-flensburg.de/lang/algorithmen/sortieren/algoen.htm
- coderslegacy.com/comparison-of-sorting-algorithms/
- web.archive.org/web/20150303022622/http:/www.sorting-algorithms.com/
- www.nist.gov/dads/
- www.softpanorama.org/Algorithms/sorting.shtml
- www.youtube.com/watch%3Fv=d2d0r1bArUQ
- www.youtube.com/watch%3Fv=kPRA0W1kECg
- Link from a Wikipage to another Wikipage
- .NET
- Adaptive sort
- Algorithm
- Algorithmic efficiency
- Android (operating system)
- Bead sort
- Best, worst and average case
- Betty Holberton
- Big omega notation
- Big O notation
- Binary heap
- Binary tree
- Bitonic sorter
- Block sort
- Bogosort
- Bubble sort
- Bucket sort
- Burstsort
- Byte Magazine
- Call stack
- Canonicalization
- Category:Data processing
- Category:Sorting algorithms
- Category:Tournament systems
- Central Processing Unit
- Cocktail shaker sort
- Cocktail sort
- Comb sort
- Comparison sort
- Computational complexity theory
- Computer bus
- Computer science
- Counting sort
- Cubesort
- Cycle sort
- Data set
- Data structure
- Decrease-and-conquer
- Distributed algorithm
- Divide-and-conquer algorithm
- Donald Shell
- Electoral system
- Elo rating system
- Embedded system
- ENIAC
- External sorting
- File:Bubblesort-edited-color.svg
- File:Python demo - sortvisu.png
- File:Shell sorting algorithm color bars.svg
- File:Sorting playing cards using stable sort.svg
- File:Sorting stability playing cards.svg
- Fisher–Yates shuffle
- Flashsort
- Floating point numbers
- Ford–Johnson algorithm
- Gnome sort
- Google Colab
- Group tournament ranking system
- Heap (data structure)
- Heapsort
- Hybrid algorithm
- In-place
- In-place algorithm
- In-place merge sort
- Insertion sort
- Insertion Sort
- Integer sorting
- Introsort
- Inversion (discrete mathematics)
- Java (programming language)
- Java version history
- JDK7
- K-sorted sequence
- Least significant digit
- Leonardo number
- Lexicographical order
- Library sort
- List (computing)
- Locality of reference
- Longest increasing subsequence
- Median
- Median of medians
- Memory (computing)
- Merge algorithm
- Merge sort
- Monotonic
- Most significant digit
- Numerical order
- Odd–even sort
- Open problem
- Operating system kernel
- Ordered array
- Pairwise comparison
- Pancake sorting
- Partial sorting
- Patience sorting
- Perl
- Permutation
- Pigeonhole sort
- Postman sort
- Python (programming language)
- Quickselect
- Quicksort
- Radix sort
- Random access
- Random-access machine
- Randomized algorithm
- Rank correlation
- Ranking (information retrieval)
- Relational database
- Samplesort
- Search algorithm
- Selection algorithm
- Selection sort
- Self-balancing binary search tree
- Sequential access
- Shellsort
- Shuffling algorithm
- Slowsort
- Smoothsort
- Sort (C++)
- Sorting
- Sorting algorithm
- Sorting network
- Spaghetti sort
- Spreadsort
- Standard Template Library
- Stooge sort
- Strand sort
- Time complexity
- Time–space tradeoff
- Timsort
- Total order
- Tournament sort
- Tree sort
- UNIVAC
- Unstable sort
- Upper and lower bounds
- Virtual memory
- Reason
- enI thought I heard that Batcher made odd-even merge sort to supersede bitonic.
- enSorting networks are highly practical; the "specialized hardware" required is a consumer-grade GPU.
- SameAs
- Algorisme d'ordenació
- Algorithimu uchanguaji
- Algorithme de tri
- Algoritma penyortiran
- Algoritm de ordenament
- Algoritmi za urejanje podatkov
- Algoritmo de ordenação
- Algoritmo de ordenamiento
- Algoritmo di ordinamento
- Datu šķirošanas algoritms
- Lajittelualgoritmi
- m.071c4
- m36B
- Nizamlama alqoritmi
- Ordenatze algoritmo
- Q181593
- Řadicí algoritmus
- Rendezés (programozás)
- Rikiavimo algoritmas
- Röðunarreiknirit
- Saralash algoritmi
- Sorteeralgoritme
- Sorteringsalgoritm
- Sorteringsalgoritme
- Sorteringsalgoritme
- Sortierverfahren
- Sortimisalgoritm
- Sorting algorithm
- Sortowanie
- Sıralama algoritması
- Thuật toán sắp xếp
- Triediaci algoritmus
- Zortéieralgorithmus
- Αλγόριθμος ταξινόμησης
- Алгоритми сортирања
- Алгоритм сортировки
- Алгоритм сортування
- Алгоритъм за сортиране
- Мәліметтерді сұрыптау
- Տեսակավորման ալգորիթմ
- מיון (אלגוריתם)
- الگوریتم مرتبسازی
- خوارزمية ترتيب
- शाटन की कलनविधि
- সর্টিং অ্যালগোরিদম
- வரிசையாக்கப் படிமுறை
- ขั้นตอนวิธีการเรียงลำดับ
- ソート
- 排序算法
- 정렬 알고리즘
- SeeAlso
- External sorting
- Subject
- Category:Data processing
- Category:Sorting algorithms
- Thumbnail
- Title
- enSorting Algorithm Animations
- Url
- https://web.archive.org/web/20150303022622/http:/www.sorting-algorithms.com/
- WasDerivedFrom
- Sorting algorithm?oldid=1123561184&ns=0
- WikiPageLength
- 64462
- Wikipage page ID
- 28442
- Wikipage revision ID
- 1123561184
- WikiPageUsesTemplate
- A
- Template:Algorithmic paradigms
- Template:Annotated link
- Template:Citation
- Template:Commons category
- Template:Disputed inline
- Template:Main
- Template:Math
- Template:Mvar
- Template:No
- Template:Reflist
- Template:See also
- Template:Short description
- Template:Snd
- Template:Sort
- Template:Sorting
- Template:Tmath
- Template:Varies
- Template:Webarchive
- Template:Wikibooks
- Template:Yes
