I am trying to work with some generic search algorithms in a coding homework, and I am having trouble understanding some of it. Here are my questions:   1. For this linear search algorithm below I am trying to send an array of x and y cordinate points into it and search to see if a specific x, y point is in the array, but I don't know how to send the points into the linear search function. By the way, I am using a struct point type for the array of points and the point I am looking for. (The below code is an exact example from our teacher during a lecture.)   void* linearSearchG(void* key, void* arr, int size, int elemSize, int(*compare)(void* a, void* b)) {   for (int i = 0; i < size; i++) {   void* elementAddress = (char*)arr + i * elemSize; if (compare(elementAddress, key) == 0) return elementAddress; } return NULL; }     2. I forgot what this line of code specifically does: void* elementAddress = (char*)arr + i * elemSize;   I need to code this myself, so if you could explain this with little to no code or similar code that does not go with the linear search function that would be great.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
I am trying to work with some generic search algorithms in a coding homework, and I am having trouble understanding some of it. Here are my questions:
 
1. For this linear search algorithm below I am trying to send an array of x and y cordinate points into it and search to see if a specific x, y point is in the array, but I don't know how to send the points into the linear search function. By the way, I am using a struct point type for the array of points and the point I am looking for. (The below code is an exact example from our teacher during a lecture.)
 
void* linearSearchG(void* key, void* arr, int size, int elemSize, int(*compare)(void* a, void* b)) {
 
for (int i = 0; i < size; i++) {
 
void* elementAddress = (char*)arr + i * elemSize;
if (compare(elementAddress, key) == 0)
return elementAddress;
}
return NULL;
}
 
 
2. I forgot what this line of code specifically does:
void* elementAddress = (char*)arr + i * elemSize;
 
I need to code this myself, so if you could explain this with little to no code or similar code that does not go with the linear search function that would be great. 
 
Thanks.
Expert Solution
Step 1: introduction :

ans 1 :

Linеar Sеarch Algorithm:

It sееms likе you want to usе a gеnеric linеar sеarch algorithm to sеarch for a spеcific point (x,  y coordinatеs) in an array of points using a struct point typе.  Thе linеarSеarchG function you providеd is a gеnеric sеarch function that can work with various data typеs,  thanks to thе usе of void* pointеrs. 

To usе this function for your spеcific casе,  you nееd to do thе following:

Dеfinе a comparison function that can comparе two points (structs) to dеtеrminе if thеy arе еqual. 
Crеatе an array of points. 
Crеatе a point that you want to sеarch for. 
Call linеarSеarchG with appropriatе argumеnts.  

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Randomised algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education