Question

You will be given an array of N elements sorted small to large. For the X and Y values ​​that satisfy the X ≤ Y condition, draw the flow diagram of the algorithm that finds the start and end addresses of the region with the numbers greater than X and less than Y with the divide and manage approach and with O (logN) complexity. Also code the algorithm in c language. (not c++)

Example:

A[0…8] array

3, 5, 7, 9, 11, 13, 18, 22, 29

For x=8 and y=24 value, start adress: 3, end adress: 7

Answer 1

#include <stdio.h> int main() { int c, first, last, middle, n, x, y, array[100]; printf("Enter number of elements\n"); scanf("%d", &n); printf("Enter %d integers\n", n); for (c = 0; c < n; c++) scanf("%d", &array[c]); printf("Enter value of x\n"); scanf("%d", &x); printf("Enter value of y\n"); scanf("%d", &y); first = 0; last = n - 1; middle = (first+last)/2; while (first <= last) { if (array[middle] < x) first = middle + 1; else if (array[middle] == x) { break; } else last = middle - 1; middle = (first + last)/2; } if (array[middle]==x) { for (c = middle+1; c < y-1; c++) printf("%d\t",c); } printf("the number that is appearing first in this list is the starting index and the last number in the list is ending index\t\t\t"); printf("\n"); printf("the number appearing in the below list is the starting address and the last number in the list is the ending address\t"); if (array[middle]==x) { for (c = middle+1; c < y-1; c++) printf("%d\t",&c); } return 0; } 

and the flow diagram will be:

ou Po Start Start-o size of the array X Hatfound to start and Yes muide(start tend)/2 Breck Found & avaylimid }=-* No Yo, s start midt Tarray culiel>key No end- mid-1 aufwuddle )==> for e-middlet; ceyjett array (cJ Premium