Sorting Algorithm

n.

Pronunciation

/ˈsɔrtɪŋ ˈælgəˌrɪðəm/

Definition

A sorting algorithm is a set of programmed rules allowing a list of elements to be organized in a specified order, most often numerical or lexicological.

One version of sorting algorithm is ‘bubble sort’, a simple yet slow approach. More efficient algorithms such as ‘merge sort’, ‘quicksort’, and ‘heap sort’ are employed in practical applications such as database management. Sorting algorithms are essential for organization of current product information and onboarding of novel information.

Category

Technology

Related Terms

Bubble Sort

Product Information Encyclopedia

©2020 by Industrial Data Associates, Inc.

4041 N. Milwaukee, Suite 301, Chicago, IL 60641, US

Logo-2CRev-34px-TM.png