Search results

Page title matches

• Sorting Algorithms
  The sorting problem is one of the most frequent algorthmic problems. Its simplest form The ''sorting problem'' is to find a sequence <math>a_{\varphi (0)}, \dots, a_{\varphi (n
  2 KB (230 words) - 14:21, 12 November 2014
• Sorting Sequences of Strings
  [[Category:Sorting]] # [[Bubblesort]] (solves the [[Sorting based on pairwise comparison|generic sorting problem]])
  1,021 bytes (134 words) - 11:38, 17 May 2015
• Sorting based on pairwise comparison
  [[Category:Sorting]]
  1 KB (201 words) - 12:30, 17 May 2015

Page text matches

• Sorting Sequences of Strings
  [[Category:Sorting]] # [[Bubblesort]] (solves the [[Sorting based on pairwise comparison|generic sorting problem]])
  1,021 bytes (134 words) - 11:38, 17 May 2015
• Selection sort
  [[Category:Sorting Algorithms]] '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  2 KB (327 words) - 11:05, 30 June 2015
• Main Page
  ** [[Sorting]] *** [[Sorting based on pairwise comparison]] (DONE)
  4 KB (380 words) - 15:13, 30 November 2020
• Bubblesort
  [[Category:Sorting Algorithms]] '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  3 KB (453 words) - 12:17, 18 September 2015
• Sorting Algorithms
  The sorting problem is one of the most frequent algorthmic problems. Its simplest form The ''sorting problem'' is to find a sequence <math>a_{\varphi (0)}, \dots, a_{\varphi (n
  2 KB (230 words) - 14:21, 12 November 2014
• Sorted sequence
  ...h>K</math> is inserted at an appropriate position in sorting order, so the sorting order is maintained.
  2 KB (270 words) - 13:06, 21 May 2015
• Bubble sort
  '''Algorithmic problem:''' [[Sorting based on pairwise comparison]] ...ns <math>|S|-i+1,\dots,|S|</math> are placed at their ocrrect positions in sorting order.
  2 KB (414 words) - 22:50, 19 June 2015
• Sorting based on pairwise comparison
  [[Category:Sorting]]
  1 KB (201 words) - 12:30, 17 May 2015
• Bucketsort
  [[Category:Sorting Algorithms]] '''Algorithmic problem:''' [[Sorting Sequences of Strings]]
  4 KB (744 words) - 22:51, 19 June 2015
• Mergesort
  [[Category:Sorting Algorithms]] '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  4 KB (617 words) - 13:36, 3 March 2017
• Quicksort
  [[Category:Sorting Algorithms]] '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  9 KB (1,575 words) - 13:36, 3 March 2017
• B-tree: merge two siblings
  ...children (all keys in this children are smaller) on the right side, so the sorting order is correct again (B-Tree #6). The copied children comes from the righ
  4 KB (724 words) - 23:19, 19 June 2015
• Kruskal for maximum spanning forest
  '''Proof:''' The summand <math>\mathcal{O}(m\cdot \log m)</math> results from sorting all edges in the preprocessing. The main loop has <math>m</math> iteration.
  5 KB (812 words) - 18:31, 20 September 2015
• Directed Tree
  ...i</math>-th and <math>(i + 1)</math>-st element of <math>S_w</math> in the sorting order defined by [[Genericity#Comparison|comparison]] <math>c</math>.
  7 KB (1,284 words) - 11:29, 26 May 2015