Java data sturcture searching and sorting

 

Guidelines
Please follow the guidelines below:
Submit the homework and lab solutions in the drop box. For a programming question,
submit a .java file (for source code) and a .txt file for program output. If the problem
involves other questions, submit a separate .txt file to answer the question.    
P1 (20 points)
Implement a binary search of an array iteratively using the methodpublic 

static <T extends Comparable<? super T>> booleaninArrayIterativeSorted(T[]
anArray, T anEntry)
P2 (30 points)
Consider an array data of n numerical values in sorted order and a list of numerical target
values (target values are not necessarily sorted). Your goal is to compute the smallest range of
array indices that contains all of the target values. If a target value is smaller than data[0], the
range should start with -1. If a target value is larger than data[n – 1], the range should end with
n.
For example, given the array [ 5 8 10 13 15 20 22 26] and the target values (8, 2, 9, 17), the
range is -1 to 5.
1.   Devise an efficient algorithm that solves this problem and implement it in
public static <T extends Comparable<? super T>>
Interval findInterval(T[] sortedData, List<T> targetValues)

where Interval is a class that provides two public methods getLower() and getUpper() to return
the lower and upper values of an Interval object. Implement the Interval class.

2.   If you have n data values in the array and m target values in the list, what is the Big Oh
performance of your algorithm?  
P3 (20 points)
Write the java code for the method
pubic static <T extends Comparable<? super T>> boolean  isSorted(T[ ] a)
which returns true if the array a is in sorted in ascending order. The code must run in O(n) time.
P4 (30 points)
Consider a revised selection sort algorithm so that on each pass it finds both the largest and
smallest values in the unsorted portion of the array. The sort then moves each of these values
into its correct location by swapping array entries.
1.   Implement the modified selection sort using the method
public static <T extends Comparable<? super T>> void modifiedSelectionSort(T[] a, int n)
2.   How many comparisons are necessary to sort n values?

Calculate Your Essay Price
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more