Below you will find example sentences with "sorted lists". The examples show how this phrase is used in real sentences and which words often surround it.

Sorted Lists in a sentence

About this phrase

  • Belongs to the word: lists

Words in this phrase

sorted lists

Meanings of words in this phrase

  • sorted can mean: simple past and past participle of sort Less frequent word
  • lists can mean: plural of list Frequent word

Context words

These words often appear near this phrase in the example sentences:

two 6× merge 6× algorithms 5× merging 5× list 4× sort 4× output 3× example 3× data 3× search 3× elements 2× input 2×

Related phrases

waiting lists linked lists

Other phrases with this word

Other phrases with lists:

waiting lists 20×

Other phrases with the same pattern

Same ending:

waiting lists linked lists

Example types with sorted lists

Below, the examples are grouped by length and sentence type:

Short example sentences

Merging two lists Merging two sorted lists into one can be done in linear time and linear space. (18 words)

Merge sort main Merge sort takes advantage of the ease of merging already sorted lists into a new sorted list. (20 words)

Then the merging of the sorted lists proceeds by changing the link values; no records need to be moved at all. (21 words)

Longer example sentences

However, given a sorted list of sums for k elements, the list can be expanded to two sorted lists with the introduction of a (k + 1)st element, and these two sorted lists can be merged in time O(2 k ). (41 words)

Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonicalizing data and for producing human-readable output. (40 words)

Merge algorithms are a family of algorithms that take multiple sorted lists as input and produce a single list as output, containing all the elements of the inputs lists in sorted order. (32 words)

Example sentences (10)

However, given a sorted list of sums for k elements, the list can be expanded to two sorted lists with the introduction of a (k + 1)st element, and these two sorted lists can be merged in time O(2 k ).

Merge algorithms are a family of algorithms that take multiple sorted lists as input and produce a single list as output, containing all the elements of the inputs lists in sorted order.

The merge() function would be similar to the one shown in the top down merge lists example, it merges two already sorted lists, and handles empty lists.

Merge sort main Merge sort takes advantage of the ease of merging already sorted lists into a new sorted list.

Another example is the merging two sorted lists: if their sentinels have data fields set to +∞, the choice of the next output node does not need special handling for empty lists.

Insertion sort main Insertion sort is a simple sorting algorithm that is relatively efficient for small lists and mostly sorted lists, and is often used as part of more sophisticated algorithms.

Merging two lists Merging two sorted lists into one can be done in linear time and linear space.

Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonicalizing data and for producing human-readable output.

For example, a binary search algorithm (with cost O(log n) ) outperforms a sequential search (cost O(n) ) when used for table lookups on sorted lists or arrays.

Then the merging of the sorted lists proceeds by changing the link values; no records need to be moved at all.