Given an array A of N distinct integers sorted in increasing order, we seek an algorithm to determine if there exists an index i such that A[i] = i. The algorithm returns i if such an index i exists, and -1 otherwise.

Give an exhaustive algorithm and obtain its running time in the worst case. Complete method match_exh() in file match.java.

Give a divide-and-conquer algorithm and obtain its running time in the worst case. Complete method match_dac() in file match.java.

Submit only file match.java. Use the main program match_main.java and input data file match.in to test your program. Check file match.out for the correct output.

Question

Given an array A of N distinct integers sorted in increasing order, we seek an algorithm to determine if there exists an index i such that A[i] = i. The algorithm returns i if such an index i exists, and -1 otherwise.

Give an exhaustive algorithm and obtain its running time in the worst case. Complete method match_exh() in file match.java.
Give a divide-and-conquer algorithm and obtain its running time in the worst case. Complete method match_dac() in file match.java.

Submit only file match.java. Use the main program match_main.java and input data file match.in to test your program. Check file match.out for the correct output.

Accepted Answer

The Answer is in the image, click to view ...

Question

Given an array A of N distinct integers sorted in increasing order, we seek an algorithm to determine if there exists an index i such

Step by Step Solution

Step: 1

Get Instant Access with AI-Powered Solutions

Step: 2

Step: 3

Ace Your Homework with AI

Students also viewed these Databases questions

Question

Question

Question

Question

Question

Question

Question

Question

Question