In Java, arrays are treated as objects. As such, arrays in J…

In Java, arrays are treated as objects. As such, arrays in Java are not allocated on the stack, and they do not involve the use of pointer arithmetic.  Thus, arrays in Java avoid the dangers of stack overflows and out-of-bounds memory accesses that are so error-prone and commonplace with the use of arrays in C++ programs.

We discussed 5 sorting and 2 searching algorithms during cla…

We discussed 5 sorting and 2 searching algorithms during class such as the bubblesort, insertion sort, selection sort, quick sort, and merge sort along with the linear search and binary search algorithms. Briefly discuss in detail the algorithm of each of these searching and sorting algorithms, including how it performs its own unique sorting/searching algorithm for an integer array data structure.  You should also include in your discussion the order of magnitude (Big-O) complexity class for each searching and sorting algorithm discussed. (Note:  Partial credit will be awarded on this question based on both the accuracy and completeness of your answers)