Merge: Difference between revisions

From Algowiki
Jump to navigation Jump to search
(Created page with "== General Information == == Abstract View == == Induction Basis == == Induction Step == == Complexity == Category:Algorithm Category:Auxiliary Algorithm")
 
Line 1: Line 1:
== General Information ==
== General Information ==
'''''Algorithmic problem:''''' Merging two sorted sequences
'''''Type of algorithm:''''' loop
'''''Auxiliary data:''''' There are two current positions: <math>i_1 \in \{0,\dots,|S_1|\}</math> and <math>i_2 \in \{0,\dots,|S_2|\}</math>
.


== Abstract View ==
== Abstract View ==

Revision as of 18:53, 25 September 2014

General Information

Algorithmic problem: Merging two sorted sequences

Type of algorithm: loop

Auxiliary data: There are two current positions: [math]\displaystyle{ i_1 \in \{0,\dots,|S_1|\} }[/math] and [math]\displaystyle{ i_2 \in \{0,\dots,|S_2|\} }[/math] .

Abstract View

Induction Basis

Induction Step

Complexity