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

Sorted Lists in a sentence

Corpus data

  • Displayed example sentences: 10
  • Discovered as a combination around: lists
  • Corpus frequency in the collocation scan: 7
  • Phrase length: 2 words
  • Average sentence length: 28.9 words

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

Sentence profile

  • Phrase position: 2 start, 6 middle, 2 end
  • Sentence types: 10 statements, 0 questions, 0 exclamations

Usage patterns

These patterns show short text windows around the phrase in the example sentences:

and mostly sorted lists and is 1× be in sorted lists it is 1× lookups on sorted lists or arrays 1× merging already sorted lists into a 1× merging two sorted lists if their 1× merging two sorted lists into one 1× of the sorted lists proceeds by 1× take multiple sorted lists as input 1×

Sentence openings and endings

Common sentence openings:

another example is 1× efficient sorting is 1× for example a 1× however given a 1× insertion sort main 1× merge algorithms are 1×

Common sentence endings:

and linear space 1× for empty lists 1× handles empty lists 1× human readable output 1× in sorted order 1× lists or arrays 1×

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

Phrases around this combination

Other phrases discovered around lists:

waiting lists 20×

Just before it in the phrase index:

sophomore year sophomore season sophomore guard sophomore forward sony pictures songs chart

Just after it in the phrase index:

soul food sound effects sound quality sound system sound waves sounds good

Other phrases with the same pattern

Same ending:

waiting lists linked lists

Corpus analysis

  • The phrase "sorted lists" has 2 words and usually appears in the middle in these examples. The average sentence has 28.9 words and is mostly made up of statements.
  • Around this phrase, patterns and context words such as and mostly sorted lists and is, be in sorted lists it is, two, merge and algorithms stand out.
  • In the phrase index, this combination connects with waiting lists, linked lists and waiting lists, linking the page to nearby combinations.

Example types with sorted lists

This selection groups the examples by length and sentence type, making usage of the full phrase easier to scan:

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.