RAPTOR (Rapid Algorithmic Prototyping Tool for Ordered Reasoning) is a flowchart-based
programming environment, designed specifically to help students visualize their algorithms.
RAPTOR programs are created visually and executed visually by tracing the execution through
the flowchart. Required syntax is kept minimum. It was designed by Martin C. Carlisle in 2015.
RAPTOR is written in a combination of C# and A# (a port of Ada to the .NET Framework)
and is only supported on Windows. Raptor requires JDK to launch
An operator directs the computer to perform some computation on data. Operators are placed
between the data (operands) being operated on (i.e. X / 3, Y + 7, N < M, etc.)
Basic math operators:
+, -, , / : +, -, *, / are defined as one would expect
* and ^ : exponentiation, Example: 2*4 is 16, 3^2 is 9
rem, mod : rem (remainder) and mod (modulus) return the remainder (what is left over)
when the right operand divides the left operand, ex 10 rem 3 is 1, 10 mod 3 is 1
Concatenation operator (+) : Joins strings and numbers (i.e. “Average is ” + (Total /
The following operators are only used in decisions
(=, !=, /=) : Used to compare numbers and strings, = is equals, != and /= are both not
<, >, >=, <= : These are defined as expected. The result of a relational comparison is a
and, or, not, xor
Precedence levels of Operators from lowest to highest:
[=, <, <=, >, >=, /=, !=], [+, -], [, /, rem, mod], [**,^]
Algorithm is a set of finite steps to accomplish a task. The Algorithm designed
are language-independent, i.e. they are just plain instructions that can be implemented in any
language, and yet the output will be the same, as expected.
We often know and implement many algorithms in our daily life like for example making tea,
going to college from home, finding prime numbers between 1 to 100, google search, Building
rocket to make it go to space etc
Algorithm to find the maximum 3 numbers:
step 1: start
step 2: enter the first number get a
step 3: enter the second number and get b
step 4: enter the third number and get c
step 5: put a condition if a>=b AND a>=c
step 6: then if yes put "a is the largest one"
step 7: if it is no put condition b>a AND b>c
step 8: if it is yes put " b is the largest one"
step 9: if it is no put " c is the largest one"