6.1) Comparison of three numbers
Problem is of comparison of values among three values , a very simple problem. Here, the decision making process is done based on the value of the parameters a,b and c. The data types of all these variables are interger.

6.2) Binary search
A binary search locates the position of an item in a sorted array. Binary search works by comparing an input value to the middle element of the array. The comparison determines whether the element equals the input, less than the input or greater. When the element being compared to equals the input the search stops and typically returns the position of the element. If the element is not equal to the input then a comparison is made to determine whether the input is less than or greater than the element. Depending on which it is the algorithm then starts over but only searching the top or bottom subset of the array's elements.
If the input is not located within the array the algorithm will usually output a unique value indicating this. Binary search algorithms typically halve the number of items to check with each successive iteration, thus locating the given item (or determining its absence) in logarithmic time. A binary search is …show more content…
It uses equality and inequality relational operators. The complete triangle program has three integer input variables A, B and C, one output variable TRI_KIND,27 nodes,14 paths and the longest path has 13 nodes through the software. It is a bigger and more complex procedure than the quadratic equation solver. The output variable returns the type of triangle corresponding to the three input variables. The triangle procedure decides whether the three input variables represent the lengths of the sides of a triangle and determines the type of the triangle, equilateral, isosceles, scalene or right angled scalene. The name of the main procedure is TRIANGLE and it has two sub