How to create an algorithm: Difference between revisions

Jump to navigation Jump to search
Line 11: Line 11:
{{Family tree | | | | A01 | | | |A01= Box 1 in Row 1}}
{{Family tree | | | | A01 | | | |A01= Box 1 in Row 1}}
{{Family tree | | | | | | | B01 | | | |B01= Box 2 in Row 2}}
{{Family tree | | | | | | | B01 | | | |B01= Box 2 in Row 2}}
{{Family tree | C01 | | | | | | | C02 |C01= Box 3 in Row 3| C02= Box 4 in Row 4}}
{{Family tree | C01 | | | | | | | C02 |C01= Box 3 in Row 3| C02= Box 4 in Row 3}}
{{Family tree/end}}
{{Family tree/end}}
<br>
<br>
Line 19: Line 19:




* Each box is represented by the content that fills the space in |  |
* Each box is represented by the content that fills the space in |  |, for example | A01 | will give:
 
 
For example | A01 | will give:


{{Family tree/start}}
{{Family tree/start}}
Line 35: Line 32:
{| class="wikitable" border="1" style="background:FloralWhite"
{| class="wikitable" border="1" style="background:FloralWhite"
|
|
Example:
If you type:
  '''<nowiki>{{Family tree/start}}</nowiki><br><nowiki>{{Family tree | | | | A01 | | | |A01= Box 1 in Row 1}}</nowiki><br><nowiki>{{Family tree | | | | |!| | | | | }}</nowiki><br><nowiki>{{Family tree | | | | B01 | | | |B01= Box 2 in Row 2}}</nowiki><br><nowiki>{{Family tree | |,|-|-|^|-|-|.| | }}</nowiki><br><nowiki>{{Family tree | C01 | | | | C02 |C01= Box 3 in Row 3| C02= Box 4 in Row 4}}</nowiki><br><nowiki>{{Family tree/end}}</nowiki>'''
  '''<nowiki>{{Family tree/start}}</nowiki><br><nowiki>{{Family tree | | | | A01 | | | |A01= Box 1 in Row 1}}</nowiki><br><nowiki>{{Family tree | | | | |!| | | | | }}</nowiki><br><nowiki>{{Family tree | | | | B01 | | | |B01= Box 2 in Row 2}}</nowiki><br><nowiki>{{Family tree | |,|-|-|^|-|-|.| | }}</nowiki><br><nowiki>{{Family tree | C01 | | | | C02 |C01= Box 3 in Row 3| C02= Box 4 in Row 4}}</nowiki><br><nowiki>{{Family tree/end}}</nowiki>'''


|
|
You will get:
{{Family tree/start}}
{{Family tree/start}}
{{Family tree | | | | A01 | | | | |A01= Box 1 in Row 1}}
{{Family tree | | | | A01 | | | | |A01= Box 1 in Row 1}}

Revision as of 16:20, 18 August 2013

Overview

An algorithm is a schematic drawing that helps organizing step by step approaches in a visually simplified way. An algorithm is formed by a set of boxes and lines that join them.

Step by Step Approach to Create an Algorithm

Introduction

  • To begin an algorithm, you should start with the following code {{family tree/start}} and end it with {{family tree/end}}.
  • You can name an algorithm by starting with following: {{family tree/summary= Name of the algorithm}}
  • The algorithm consists of boxes that occupy virtual rows:
 
 
 
Box 1 in Row 1
 
 
 
 
 
 
 
 
 
Box 2 in Row 2
 
 
 
Box 3 in Row 3
 
 
 
 
 
 
Box 4 in Row 3



  • Each row is represented by the following where each | | represents a space.:

{{Family tree | | | | | | | | | }}


  • Each box is represented by the content that fills the space in | |, for example | A01 | will give:
 
A01
  • In order to link the boxes you need to use symbols. The basic symbols that you will most commonly use are the following:
    • ! will link two boxes placed vertically on top of each other
    • - will link two boxes placed horizontally next to each other
    • ^ will link bifurcate a line arising from a box into two branches.

If you type:

{{Family tree/start}}
{{Family tree | | | | A01 | | | |A01= Box 1 in Row 1}}
{{Family tree | | | | |!| | | | | }}
{{Family tree | | | | B01 | | | |B01= Box 2 in Row 2}}
{{Family tree | |,|-|-|^|-|-|.| | }}
{{Family tree | C01 | | | | C02 |C01= Box 3 in Row 3| C02= Box 4 in Row 4}}
{{Family tree/end}}

You will get:

 
 
 
Box 1 in Row 1
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Box 2 in Row 2
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Box 3 in Row 3
 
 
 
Box 4 in Row 4