Explanation: freivalds algorithm is a probabalistic randomized algorithm we use to verify matrix multiplication. on the other hand, randomness can be useful in quicksort. if the algorithm selects pivot element uniformaly at random, it has a probably high probabilty of finishing the work in o(nlogn) time regardless of the input.