Design an algorithm to find all the non-common elements in two sorted lists of numbers. What is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are m and n, respectively?
2. Estimate how many times faster it will be to find gcd(98765, 56789) by Euclid's algorithm compared with the algorithm based on checking consecutive integers from min{m, n} down to gcd(m, n).
3. For each of the following functions, indicate how much the function's value will change if its argument is increased five-fold.
a.
b.
c.
d.
e.
f.
4. Write a Java or Python program that finds the binary representation of a positive decimal integer.
Title_with_topic:
1. Algorithm for finding non-common elements in sorted lists
2. Speed comparison of Euclid's algorithm and consecutive integer checking algorithm for finding gcd
3. Change in function value with a five-fold increase in argument
4. Program to find binary representation of a decimal integer