Quicksort

Describe how the quicksort works including a discussion of the pivot, how it is selected, and why the pivot is important to the quicksort. Let’s start describing what pivot is, its function and why is so important. The pivot is the element that basically divides the array in two halves, where the left half contains the smaller values and the right half contains the greater values. The pivot can be selected in many ways. First, last, middle element, actually any element of the array can be equally chosen for the pivot it all depends on how you want to implemented the array; if you select first or last will cause worst-case performance if you choose middle would be a better choice because it minimizes the chances of encountering worse case O(n2).…

#Write a program that implements the Bubblesort algorithm #Registers used: # $a0 : For loading Syscall parameters like loading integer, string # address # $V0 : For intiating particular syscall and return values # $a1 : used as a argument to quicksort subroutine # $a2 : used as a argument to quicksort subroutine # $s1 : End address of iput array also as pointer # $s4,$t2 : Base Address of input array acts as pointer # $s3 : used to restore the address back to $s2 .text la…