Write the algorithm which sorts the array by using the bubble sort algorithm. Then find the complexity of the algorithm as Big O notation

This is method is in the Java Arrays and uses the most efficient sort algorithm possible to sort an array. We should always use it in practice because it has been verified by years of use by Java programmer._______

Assume nums is an array of integers that looks like this: -3 12 9 0 2 -1 If we are sorting from smallest to largest, what will nums look like after 2 times through the outside loop if we are using bubble sort? Note: When you're entering the values, make sure you leave at least one space between them. Would it be possible to perform a linear search on a 2-D array? Answers: Yes, but you would be limited to using only one loop No, because a 2-D array is not stored in linear fashion in RAM Yes, as long as you used the proper nested loops No, you would have to use a binary search Yes, but only if the array's elements were sorted

Given the following array, what is the content of the array after Three passes of Insertion Sort? array: 44   12   50   3   40     23   Question 5 options:   3  12  44  50  40  23   12  44  50  3  40  23   12  3  23  40  44  50   12  3  44  50  40  23