Question

ASSIGNMENT: Create a program to do the following:

BONUS: A bonus of 20 points if you create the program in such a way that there is no limit on the number of names to be handled.

1) Read in names to sort until the user types the “enter” key as the first character of a “C-type” string (the maximum number of names is 20, there is not a maximum length to a name), using a two dimensional array of characters.

2) After sorting and displaying the array of “C-type” strings, ask the user for a “Ctype” string to search for (again, no maximum length).

3) Do a binary search to find if the “C-type” string is in the array

4) If the “C-type” string is in the array, tell the user the index of the “C-type” string.

5) If the “C-type” string is not in the array, tell the user that it is missing.

6) Repeat items 3 thru 5 until the user enters the “enter” key as the first character of the “C-type” string, at which time the program will complete.

Please write the code for c programming

copy of the .c and .h files in the project folder as created by Visual Studio.

Answer 1

main.c

#include"function.h"

#define MAX_SIZE 20

int main()

{

char names[MAX_SIZE][256],name[256];

int i=0,j=0,index,len;

while(1)

{

printf("Enter name (press enter to stop) :");

fgets(name,sizeof(name),stdin);

if(name[0]=='\n')

break;

len=strlen(name);

name[len-1]='\0';

strcpy(names[i],name);

i++;

}

printf("\nBefore sorting the array is : \n");

print(names,i);

sortArray(names,i);

printf("\nBefore sorting the array is : \n");

print(names,i);

while(1)

{

printf("Enter name to search (press enter to stop) :");

fgets(name,sizeof(name),stdin);

if(name[0]=='\n')

break;

len=strlen(name);

name[len-1]='\0';

index=binarySearch(names, 0, i, name);

if(index>=0)

printf("%s is in the array at index %d \n",name,index+1);

else

printf("%s is not present in the array. \n",name);

}

return 0;

}

function.h

#include<stdio.h>

#include<string.h>

void sortArray(char name[][256],int n)

{

int i,j;

char temp[256];

for (i = 0; i < n - 1 ; i++)

{

for (j = i + 1; j < n; j++)

{

if (strcmp(name[i], name[j]) > 0)

{

strcpy(temp, name[i]);

strcpy(name[i], name[j]);

strcpy(name[j], temp);

}

}

}

}

void print(char names[][256],int n)

{

int j;

for(j=0;j<n;j++)

printf("%s\n",names[j]);

}

int binarySearch(char arr[][256], int l, int r, char name[256])

{

if (r >= l) {

int mid = l + (r - l) / 2;

  

// If the element is present at the middle

// itself

if (strcmp(arr[mid],name)==0)

return mid;

  

// If element is smaller than mid, then

// it can only be present in left subarray

if (strcmp(arr[mid],name)>0)

return binarySearch(arr, l, mid - 1, name);

  

// Else the element can only be present

// in right subarray

return binarySearch(arr, mid + 1, r, name);

}

  

// We reach here when element is not

// present in array

return -1;

}

output

If you have any query regarding the code please ask me in the comment i am here for help you. Please do not direct thumbs down just ask if you have any query. And if you like my work then please appreciates with up vote. Thank You.

Enter name (press enter to stop) :Jay Enter name (press enter to stop) Manish Enter name (press enter to stop) Viral Enter name (press enter to stop) Bijal Enter name (press enter to stop) Before sorting the array is: Day Manish Viral Bijal Before sorting the array is: Bijal Day Manish Viral Enter name to search (press enter to stop) :Manish Manish is in the array at index 3 Enter name to search (press enter to stop) :pooja pooja is not present in the array Enter name to search (press enter to stop) :Jay Day is in the array at index 2 Enter name to search (press enter to stop) rP ^騰佪4× ENIG 07-04-2019号 14:35 O Type here to search