1. Engineering
  2. Computer Science
  3. write a brute force algorithm to solve the following problem...

Question: write a brute force algorithm to solve the following problem...

Question details

Write a brute force algorithm to solve the following problem: INPUT: An array A[0.n-1] of n non-negative integers OUTPUT: Return TRUE if there are two values that are exactly different by one. Return FALSE if such values do not exist What is the asymptotic running time of your algorithm?

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution