The classic procedures for putting items in order and finding them again. Quicksort and merge sort are efficient general-purpose comparison sorts that divide a list and combine or partition the parts, and binary search finds a value in a sorted array by repeatedly halving the range to be examined. They are among the first algorithms taught because they show how the method chosen changes the work needed as the data grows.
Browse By
Sorting and Searching Algorithms
Filter Results3 entries
Sources
Binary search (Wikipedia)
Has Member: Binary Search, LeadQuote, Has Member: Binary Search, Lead
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array.
Wikipedia: Quicksort
Wikimedia FoundationHas Member: Quicksort, LeadQuote, Has Member: Quicksort, Lead
Quicksort is an efficient, general-purpose sorting algorithm.
Wikipedia: Merge sort
Wikimedia FoundationHas Member: Merge Sort, LeadQuote, Has Member: Merge Sort, Lead
Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.