Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists. The steps are: Pick an element, called a pivot, from the list. Reorder the list so that all elements with values less than the pivot come before the

BUBBLESORT VS QUICKSORT (3 SENARIOS) VS MERGESORT compile with g-BUBBLESORT VS QUICKSORT (3 SENARIOS) VS MERGESORT compile with gcc