What sorting algorithms belong to Stable? try to find the classification from Web search. multiple choice a. Binary tree sort b. Insertion sort O c. Radix sort Od. Quick sort Oe. Bubble sort Of. Heap sort Og. Merge sort

How does a Ford-Fulkerson implementation determine augmenting paths?a. BFSb. DFSc. Topological sortingd. Not specified Which of the following sorts is stable? a. heap sortb. bubble sortc. quick sort d. selection sort

Answer the question using bubble sort, enhanced bubble sort (this was the version presented in lecture), selection sort, and insertion sort. Thy has data that she suspects may already be sorted. Which sorting method should she NOT use and why?

List, BST (binary search trees), and AVL each provide their own distinct hurdles in terms of necessary search time; describe how each method achieves its performance.

2. Given the resulting sorted list, trace the execution for a binary search, searching for the number 97. Note: the index of midpoints is (i+j)/2, where i and j are starting and ending indices in a step. 2 6 11 25 35 56 80 88 97 99

Which sorting algorithm is O(n2) even in the best case?a. quicksort b. merge sort c. selection sort d. insertion sort

Write a Java program to implement the Selection sort algorithm for sorting a list of integers in descending order.