Definition, Bedeutung & Anagramme | Englisch Wort SORTED

---

Definitionen von SORTED

1. Präteritum (simple past) des Verbs sort
2. Partizip Perfekt (past participle) des Verbs sort

---

---

---

---

---

---

---

---

---

Beispiele für die Verwendung von SORTED in einem Satz

• 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.
• In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.
• In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.
• Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons.
• Divide the unsorted list into n sublists, each containing one element (a list of one element is considered sorted).
• 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.
• NATO reporting name/Air Standardization Coordinating Committee (ASCC) names for miscellaneous aircraft, with Soviet and Chinese designations, sorted by reporting name:.
• Given an array of values to be sorted, set up an auxiliary array of initially empty "pigeonholes" (analogous to a pigeon-hole messagebox in an office or desk), one pigeonhole for each key in the range of the keys in the original array.
• Radix sort can be applied to data that can be sorted lexicographically, be they integers, words, punch cards, playing cards, or the mail.
• 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.
• The algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list and a sublist of the remaining unsorted items that occupy the rest of the list.
• All of the polygons to be rendered are first sorted by the top y coordinate at which they first appear, then each row or scan line of the image is computed using the intersection of a scanline with the polygons on the front of the sorted list, while the sorted list is updated to discard no-longer-visible polygons as the active scan line is advanced down the picture.
• The idea is to arrange the list of elements so that, starting anywhere, taking every hth element produces a sorted list.
• This is a list of countries and dependencies ranked by population density, sorted by inhabitants per square kilometre or square mile.
• Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.
• For instance, when used as a subroutine in radix sort, the keys for each call to counting sort are individual digits of larger item keys; it would not suffice to return only a sorted list of the key digits, separated from the items.
• Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.
• This fluvial terrace is underlain by stratified; yellowish brown to grayish brown; calcareous; and usually clean and moderately well sorted sand and gravel with cobbles and boulders.
• If large lists must be sorted at high speed for a given application, timsort is a better choice; however, if minimizing the memory footprint of the sorting is more important, bubble sort is a better choice.
• The original Big5 character set is sorted first by usage frequency, second by stroke count, lastly by Kangxi radical.
• Below is a list of missiles, sorted alphabetically into large categories and subcategories by name and purpose.
• By shortening the part of the list that is sorted each time, the number of operations can be halved (see bubble sort).
• This is a list of lists of historical and living Albanians (including ethnic Albanians and people of full or partial Albanian ancestry) who are famous or notable, sorted by occupation and alphabetically.
• A popular family of sorters, the IBM 80 series sorters, sorted input cards into one of 13 pockets depending on the holes punched in a selected column and the sorter's settings.
• For example, to sort a given list of n natural numbers, split it into two lists of about n/2 numbers each, sort each of them in turn, and interleave both results appropriately to obtain the sorted version of the given list (see the picture).

Die Seitenvorbereitung dauerte: 318,83 ms.