Using C++ or Java, compare the bubble sort, inclusion sort, and margesort algorithms.  Make a large array (as large as 1 million) .  After adding random numbers to it, record the time and all of the algorithms, record the time once again, and calculate the effective t

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.

Using JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.

Java

Create four methods named insertionSort(), bubblesort(), mergesort() and quicksort(). Implement the sorting algorithms in the corresponding methods. In the main method, create four arrays a, b, c, d and initialize them with the same values. Pass these four arrays in four different functions. Create four instance variables named insertionSwap, bubbleSwap, countMerge, and countQuickSort and initialize them to 0. In methods insertionSort(), bubblesort() and quicksort(), increment the variables insertionSwap, bubbleSwap, and countQuickSort respectively by one whenever they call the method swap(). In method mergesort(), increment the variable countMerge by one to count the swaps. Use method swap() to swap the values.