Which methods/actions in the Sorted Array can be made significantly more efficient compared to the Unsorted Array? Why is this? In other words, what can be done in the Sorted Array implementation to radically improve the efficiency that can't be done in an Unsorted Array?

Give one positive and one negative property of dynamic arrays when compared to static arrays. the best answer will use Big Oh. Explain your answer

Please help. The programming language to be used is java.

There are two arrays one called A[50][30] and one called B[50][30]. The elements in each array are unique and different . Explain by pseudo-code the ways one could employ to move elements from the array A to array B. Can you explain how would one code a method to do this without using the array elements specifically? I need help in this question.

Sort the ArrayList of the student objects into ascending order of the students’ numbers (IDs),and output the sorted array - implement an appropriate sorting algorithm for this, and explainwhy such algorithm is selected (in internal and external documentation). how do I come up with an algorithm to sort the array in an ascending order?

Answer the given question with a proper explanation and step-by-step solution. java

java (1) Implement the function by allocating a new n X n 2D array. Then write the rotation to it by writing the rows of the original matrix to the columns in the solution matrix such that they fit the solution require[1]ment. Then copy the new matrix exactly the same to the original matrix so that you know for sure you have updated the original matrix to look modified. (2) Implement the function by not allocating a new n X n 2D array. Hint : Perform the rotation in a layer by layer fashion - meaning - different layers can be processed independently. Also within a layer, you can exchange groups of four elements at a time to perform the rotation. Example : Send 1 to 4’s location, 4 to 16’s location, 16 to 13’s location and 13 to 1’s location. Ungraded but Important : As a comment in your code for Problem 2, write your observation on the different solutioning methods utilized. should speak in terms of Time and Space Complexity. Which solution does what in terms of time and...

Compare the sorting times of the insertion sort with QuickSort using a small array (less than 20). What is the time difference? Could you explain why?