+1 (305 )-814-1214
+1 (305 )-814-1214 Toll-free
Log in
Log in
Order Now
All your Writing needs covered

Java data sturcture searching and sorting

Get a Price Order Now

Calculate the price
of
your order:

275 words
+ –
Approximate price
$ 0.00

Java data sturcture searching and sorting   GuidelinesPlease 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> 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 inpublic static <T extends Comparable>Interval findInterval(T[] sortedData, List 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 methodpubic static <T extends Comparable> 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 methodpublic static <T extends Comparable> void modifiedSelectionSort(T[] a, int n)2.   How many comparisons are necessary to sort n values?

«VPNEW»

Unlock your academic potential with Vintage-paper.com! Place your essay order today and experience top-notch writing services that guarantee academic success. Our expert writers are ready to craft customized papers that will exceed your expectations.Don't wait, order now and elevate your grades

Order Now

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
  • 12pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, CHicago/Turabian, Havard)

Guaranteed originality

We guarantee 0% plagiarism! Our orders are custom made from scratch. Our team is dedicated to providing you academic papers with zero traces of plagiarism.

Affordable prices

We know how hard it is to pay the bills while being in college, which is why our rates are extremely affordable and within your budget. You will not find any other company that provides the same quality of work for such affordable prices.

Best experts

Our writer are the crème de la crème of the essay writing industry. They are highly qualified in their field of expertise and have extensive experience when it comes to research papers, term essays or any other academic assignment that you may be given!

Calculate the price of your order

You will get a personal manager and a discount.
We'll send you the first draft for approval by at
Total price:
$0.00

Expert paper writers are just a few clicks away

Place an order in 3 easy steps. Takes less than 5 mins.

Check Prices
Order Now