Question

Question 9 12 pts Let's assume that charlist() is an array of 10000 strings stored in the array in the increasing order of their length (shortest string is stored at index 0 and longest one is store at index 9999). Write an efficient function with the following signature that gets the list of strings as its first input parameter and returns a binary number (0 or 1) indicating whether the list contains a string of length n where n is the second input parameter. int contains (char* list[], int n) ...//returns O if no string in list has length n and returns 1 otherwise.

Answer 1

#include<stdio.h>
#include<string.h>
//function to check whether the list contains the string with given length
int contains(char* list[], int n, int len)
{
   //initialize low and high
   int low = 0;
   int high = len - 1;
   //iterate while low is less than high
   while(low <= high)
   {
       //calculate the mid
       int mid = (int)(low + high)/2;
       //check whether the length of stirng at mid is equal to given size
       if(strlen(list[mid]) == n)
       {
           return 1;  
       }
       //if the length of string at mid is less than given length check right of the array
       else if(strlen(list[mid]) < n)
       {
           low = mid + 1;
       }
       //otherwise check the left of the array
       else
       {
           high = mid - 1;
       }
   }
   return 0;
}
int main()
{
   //create a list
   char* list[] = {"", "a", "ab", "abc", "abcd", "abcde", "abcdef", "abcdefg", "abcdefgh"};
   //call the function
   int output = contains(list, 5, 9);
   //print the output
   printf("%d\n", output);
}

Activities Terminal Sat 06:58 deepika@deepika-TravelMate-P243-M: -/Desktop File Edit View Search Terminal Help deepika@deepika-TravelMate-P243-M:-/Desktops gcc contains_length.c deepika@deepika-TravelMate-P243-M:-/Desktop$ ./a.out 1 deepika@deepika-TravelMate-P243-M:-/Desktops | EN

If you have any doubts please comment and please don't dislike.