Java Foundations

What is the order of each of the following growth functions? Also, rearrange the polynomials and write them each in increasing order. Clearly write out each entire polynomial. In your ordering, clearly label which polynomial is lowest order and which is highest order.

a. 10n2 + 100n + 1000

b. 10n3 - 7

c. 2n + 100n3

d. n2 log n

Write the code necessary to find the largest element in an unsorted array of integers. What is the time complexity of this algorithm? Include the code as a static method. Paste into this document only the method code. Do not paste a complete class; though for your own sake, you should write a class to test your method before submitting.

Compare and contrast the linearSearch and binarySearch algorithms by searching for the numbers 45 and 54 in the list 3, 8, 12, 34, 54, 84, 91, 110. Describe and list out every comparison done between the search term and the list, those done by linear search and also those done by binary search. How many of these comparisons does each algorithm do?

Consider the following list: 90 8 7 56 123 235 9 1 653 Show a trace of execution for:

a. selection sort

b. insertion sort

c. bubble sort

A trace of execution means that you should write the list again each time it changes when something is moved or swapped during the sorting algorithm. Write each copy of the array on a separate line of text.