1. Explain the following algorithms for Quick Sort INPUT: A[1..n]- an array of integers 1,r-integers satisfying...

 

Transcribed Image Text:

1. Explain the following algorithms for Quick Sort INPUT: A[1..n]- an array of integers 1,r-integers satisfying 1 <l<r<n OUTPUT: permutation of the segment A[1..r] s.t. A[1]s A[1+1]s...s A[r] Quicksort (A, 1, r) if 1 < r then m = Partition (A, 1, 1) Quicksort (A,1,m-1) Quicksort (A, m+1, r) 2. Say if you have an array of 10 integers as bellow, show how the quicksort work. A[1,,10] [2, 4, 8, 5, 9, 6, 1, 10, 3, 7] 1. Explain the following algorithms for Quick Sort INPUT: A[1..n]- an array of integers 1,r-integers satisfying 1 <l<r<n OUTPUT: permutation of the segment A[1..r] s.t. A[1]s A[1+1]s...s A[r] Quicksort (A, 1, r) if 1 < r then m = Partition (A, 1, 1) Quicksort (A,1,m-1) Quicksort (A, m+1, r) 2. Say if you have an array of 10 integers as bellow, show how the quicksort work. A[1,,10] [2, 4, 8, 5, 9, 6, 1, 10, 3, 7]

Answer rating: 100% (QA)

Answer 1 An array is prepared for sorting by the quicksort algorithm by first being split into t... View the full answer