LAB211 Assignment
Type: Short Assignment
Code: s1qo3u-
j1_s_p0006.docx
LOC: 70
Slot(s): 1
Title
Binary search algorithm.
Background Context
Generally, to find a value in unsorted array, we should look through elements of an array one by one, until searched
value is found. In case of searched value is absent from array, we go through all elements. In average, complexity of
such an algorithm is proportional to the length of the array.
Situation changes significantly, when array is sorted. If we know it, random access capability can be utilized
very effi ciently to find searched value quick. Cost of searching algorithm reduces to binary logarithm of the array
length. For reference, log2(1 000 000) ≈ 20. It means, that in worst case, algorithm makes 20 steps to find a value in
sorted array of a million elements or to say, that it doesn't present it the array.
Program Specifications
Design a program that allows users to input the number of array. Generate random integer in number range
input. After that allows users to input search number. Display sorted array and index of search number in array.
Function details:
1. Display a screen to prompt users to input a positive decimal number.
oUsers run the program, display a screen to ask users to enter a number of array and a search number.
oUsers input a positive decimal number. Then, perform Function 2.
2. Display the found index in array.
oGenerate random integer in number range for each array element.
oSort array
oDisplay the index of search number in array.
Expectation of User interface:
Guidelines
