Search results

Page title matches

• Sorted sequence
  [[Category:Sequence]] # The abstract data structure '''sorted sequence''' implements sorted sequences as defined [[Sets and sequences#Ordered and
  2 KB (270 words) - 13:06, 21 May 2015
• Ordered sequence
  [[Category:Sequence]] # The abstract data structure '''ordered sequence''' implements sorted sequences as defined [[Sets and sequences|here]].
  2 KB (252 words) - 12:52, 21 May 2015
• Find an element in a sequence
  # A sequence <math>S</math>. # [[Find element in sequence iteratively]]
  495 bytes (68 words) - 19:53, 1 October 2014

Page text matches

• Find an element in a sequence
  # A sequence <math>S</math>. # [[Find element in sequence iteratively]]
  495 bytes (68 words) - 19:53, 1 October 2014
• Union-find with lists
  ...<math>\{1,\ldots,N\}</math> and component type "[[Ordered sequence|ordered sequence]] of integral numbers". # Each non-empty sequence in this array contains one of the partition sets, that is:
  3 KB (419 words) - 14:27, 20 June 2015
• Sorted sequence
  [[Category:Sequence]] # The abstract data structure '''sorted sequence''' implements sorted sequences as defined [[Sets and sequences#Ordered and
  2 KB (270 words) - 13:06, 21 May 2015
• Ordered sequence
  [[Category:Sequence]] # The abstract data structure '''ordered sequence''' implements sorted sequences as defined [[Sets and sequences|here]].
  2 KB (252 words) - 12:52, 21 May 2015
• Main Page
  *** [[Find an element in a sequence]] (DONE) *** [[Insert an element in a sequence]] (Empty in old wiki?!)
  4 KB (380 words) - 15:13, 30 November 2020
• Array list: find
  '''Algorithmic problem:''' [[Ordered sequence#Find|Ordered sequence: find]] '''Statement:''' Linear in the length of the sequence in the worst case.
  2 KB (262 words) - 23:10, 19 June 2015
• Array list: number
  '''Algorithmic problem:''' [[Ordered sequence#Number|Ordered sequence: number]] '''Statement:''' Linear in the length of the sequence in the worst case (if the arrays of all array list items have identical len
  2 KB (265 words) - 23:10, 19 June 2015
• Binary search tree: find
  ...style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">[[Sorted sequence]]</div> '''Algorithmic Problem:''' [[Sorted sequence#Find|Sorted Sequence:find]]
  3 KB (425 words) - 13:38, 3 March 2017
• Exhaustive graph traversal
  A sequence of all nodes of <math>G</math>.
  195 bytes (27 words) - 07:21, 3 November 2014
• Sets and sequences
  An '''ordered sequence''' (or '''sequence''', for short) is given by ...e sequence (a.k.a. the '''indexes'''). The element <math>\pi (i)</math> of sequence <math>S</math> at position <math>i</math> is denoted by <math>S[i]</math>.
  5 KB (783 words) - 12:24, 21 May 2015
• Array list
  '''Abstract Data Structure:''' [[Ordered sequence]] ...e components <math>A[1|,\ldots,A[n]</math> are the elements of the ordered sequence that are stored in this item (in this order).
  1 KB (227 words) - 09:59, 21 September 2015
• Array list: insert at position
  '''Algorithmic problem:''' [[Ordered sequence#Insert at position|Ordered sequence: insert at position]] ...hat, in an implementation of [[Ordered sequence#Insert at position|Ordered sequence: insert at position]], we may assume <math>l \leq</math>number(). Therefore
  4 KB (628 words) - 12:57, 18 September 2015
• Binary search tree: insert
  ...style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">[[Sorted sequence]]</div> '''Algorithmic problem:''' [[Sorted sequence#Insert|Sorted sequence: insert]]
  4 KB (716 words) - 13:39, 3 March 2017
• Binary search tree: remove
  ...style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">[[Sorted sequence]]</div> '''Algorithmic Problem:''' [[Sorted sequence#Remove|Sorted sequence:remove]]
  5 KB (762 words) - 13:39, 3 March 2017
• Sorting Algorithms
  Let <math>n \in \N</math> and <math>a = a_0, \dots, a_{n-1}</math> a finit sequence with <math>a_i \in \N \quad (i = 0, \dots, n-1)</math> The ''sorting problem'' is to find a sequence <math>a_{\varphi (0)}, \dots, a_{\varphi (n-1)}</math> with folloing constr
  2 KB (230 words) - 14:21, 12 November 2014
• Binary search tree
  [[Sorted sequence]] * Besides the methods of [[Sorted sequence|sorted sequences]], binary search trees in the implementation chosen here h
  2 KB (353 words) - 06:14, 6 July 2015
• Graph traversal
  An [[Sets and sequences#Ordered and sorted sequences|ordered sequence]], whose content is a permutation of all nodes of <math>G</math> that can b ...thms deliver specific additional output besides the above-mentioned output sequence. In each case, additional output is specified on the page of the respective
  2 KB (314 words) - 19:06, 9 November 2014
• Array list: remove
  '''Algorithmic problem:''' [[Ordered sequence#Remove|Ordered sequence: remove]] '''Statement:''' Linear in the length of the sequence in the worst case.
  5 KB (808 words) - 23:11, 19 June 2015
• Binary search tree: remove node
  ...style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">[[Sorted sequence]]</div> ...dot n)</math> in the worst case, where <math>n</math> is the length of the sequence, <math>h</math> the height of the tree, and <math>T</math> the complexity o
  3 KB (454 words) - 13:39, 3 March 2017
• Quicksort
  '''Invariant:''' After a recursive call, the input sequence of this recursive call is sorted. '''Variant:''' In each recursive call, the sequence of the callee is strictly shorter than that of the caller.
  9 KB (1,575 words) - 13:36, 3 March 2017

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)