Answer to Question #192338 in Algorithms for perwesha

Question

Consider a list of unsorted numbers, think about an algorithm to test all the items in the list to check whether there are any two consecutive numbers (even if they are not adjacent) or not. • For example 1: List A = [10,7,23,18,45, 24] -> output: true o the output is True because 23 and 24 are consecutive numbers (even not adjacent). • For example 2: List B = [24,15,18,18,42, 22] -> output: false o the output of example 2 is False because there isn’t any consecutive numbers. Now, answer the following Questions: 1- Write an algorithm to solve the above problem? 2- Can you write a new algorithm that is more efficient than the one you wrote in question1 which does the same job? if the answer is yes you need to write down the new algorithm, if not you need to mention that your solution is the best solution? 

Answer 1

Dear perwesha, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order