You have your data and it is stored in a Linked List data structure, I told you to use Binary Search. Is my advice to you a good one or bad one, WHY? If it is a bad advice, then tell me what a more suitable algorithm you should use. Euclid\'s algorithm: Briefly describe what does Euclid\'s algorithm do for a pair of numbers in which the first number is smaller than the second one? How many times this can happen during the algorithm\'s execution on such an input? Find gcd(120, 17) using Euclid\'s algorithm, show your steps. Solution 1. a. your advice is bad as the linked list contains the data at different positions in the memory and each list node contains the address of the next node and if we implement the binary search it will be very long and difficult process to search for the mid address, top address and bottom addresses. b. I will instead use linear search as it is easy to have the start node address and using only that we can search the whole list without any difficulty .

1. You have your data and it is stored in a Linked List data structure, I told you to use Binary
Search. Is my advice to you a good one or bad one, WHY? If it is a bad advice, then tell me what
a more suitable algorithm you should use. Euclid's algorithm: Briefly describe what does
Euclid's algorithm do for a pair of numbers in which the first number is smaller than the second
one? How many times this can happen during the algorithm's execution on such an input? Find
gcd(120, 17) using Euclid's algorithm, show your steps.
Solution
1.
a. your advice is bad as the linked list contains the data at different positions in the memory and
each list node contains the address of the next node and if we implement the binary search it will
be very long and difficult process to search for the mid address, top address and bottom
addresses.
b. I will instead use linear search as it is easy to have the start node address and using only that
we can search the whole list without any difficulty