When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Template:Date table sorting - Wikipedia

    en.wikipedia.org/wiki/Template:Date_table_sorting

    Day and month numbers may be 1 or 2 digits, and year numbers may only be 3 or 4 digits. If you need to input a number less than 1000, use leading zeroes (e.g. "0700"). BC years can only be parsed if the date is only the year number.

  3. Category:String sorting algorithms - Wikipedia

    en.wikipedia.org/wiki/Category:String_sorting...

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more

  4. Substring index - Wikipedia

    en.wikipedia.org/wiki/Substring_index

    In computer science, a substring index is a data structure which gives substring search in a text or text collection in sublinear time. Once constructed from a document or set of documents, a substring index can be used to locate all occurrences of a pattern in time linear or near-linear in the pattern size, with no dependence or only logarithmic dependence on the document size.

  5. ISO 8601 - Wikipedia

    en.wikipedia.org/wiki/ISO_8601

    ISO 8601 is an international standard covering the worldwide exchange and communication of date and time-related data.It is maintained by the International Organization for Standardization (ISO) and was first published in 1988, with updates in 1991, 2000, 2004, and 2019, and an amendment in 2022. [1]

  6. Natural sort order - Wikipedia

    en.wikipedia.org/wiki/Natural_sort_order

    In computing, natural sort order (or natural sorting) is the ordering of strings in alphabetical order, except that multi-digit numbers are treated atomically, i.e., as if they were a single character. Natural sort order has been promoted as being more human-friendly ("natural") than machine-oriented, pure alphabetical sort order.

  7. Burstsort - Wikipedia

    en.wikipedia.org/wiki/Burstsort

    And although asymptotically it is the same as radix sort, with time complexity of O(wn) (w – word length and n – number of strings to be sorted), but due to better memory distribution it tends to be twice as fast on big data sets of strings. It has been billed as the "fastest known algorithm to sort large sets of strings". [2]

  8. Integer sorting - Wikipedia

    en.wikipedia.org/wiki/Integer_sorting

    In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer sorting may also often be applied to sorting problems in which the keys are floating point numbers, rational numbers, or text strings. [1]

  9. Collation - Wikipedia

    en.wikipedia.org/wiki/Collation

    Sorting decimals properly is a bit more difficult, because different locales use different symbols for a decimal point, and sometimes the same character used as a decimal point is also used as a separator, for example "Section 3.2.5". There is no universal answer for how to sort such strings; any rules are application dependent.