, j) ) to be partitioned is a(0..6). s already been moved to be the element a(6). ur of the algorithm by showing which element swaps it performs. ick on the two elements in question. possible swaps between element and itself, as well as the final swap moving the pivot
, j) ) to be partitioned is a(0..6). s already been moved to be the element a(6). ur of the algorithm by showing which element swaps it performs. ick on the two elements in question. possible swaps between element and itself, as well as the final swap moving the pivot
Related questions
Question
![Lomuto's partitioning algorithm
Consider the implementation of Lomuto's partitioning algorithm shown below.
def swap(a: Array[Int], i: Int, j: Int): Unit =
val t = a(i); a(i)
a(j); a(j) = t
/* Partition the sub-array a(lo..hi).
* Return the index of the pivot element in the result. */
def partition(a: Array[Int], lo: Int, hi: Int): Int =
val pivot a(hi)
var i lo
var j = lo
while j < hi do
if a(j) <= pivot then
swap(a, i, j)
i += 1
j += 1
swap(a, i, hi)
i
=
Assume that the array to be partitioned is a(0..6).
The pivot element has already been moved to be the element a(6).
Simulate the behaviour of the algorithm by showing which element swaps it performs.
To perform a swap, click on the two elements in question.
Remember to include possible swaps between element and itself, as well as the final swap moving the pivot in its correct place.
0 1
13 9
Swaps performed:
2 3
6
4
15 5
5
6 7 8
13 11 17 19](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3802b3a4-f93d-4b7b-94b3-88a2c6183309%2F849fef56-964d-4099-9e8f-95bd7c2638fb%2F7dtvzgm_processed.png&w=3840&q=75)
Transcribed Image Text:Lomuto's partitioning algorithm
Consider the implementation of Lomuto's partitioning algorithm shown below.
def swap(a: Array[Int], i: Int, j: Int): Unit =
val t = a(i); a(i)
a(j); a(j) = t
/* Partition the sub-array a(lo..hi).
* Return the index of the pivot element in the result. */
def partition(a: Array[Int], lo: Int, hi: Int): Int =
val pivot a(hi)
var i lo
var j = lo
while j < hi do
if a(j) <= pivot then
swap(a, i, j)
i += 1
j += 1
swap(a, i, hi)
i
=
Assume that the array to be partitioned is a(0..6).
The pivot element has already been moved to be the element a(6).
Simulate the behaviour of the algorithm by showing which element swaps it performs.
To perform a swap, click on the two elements in question.
Remember to include possible swaps between element and itself, as well as the final swap moving the pivot in its correct place.
0 1
13 9
Swaps performed:
2 3
6
4
15 5
5
6 7 8
13 11 17 19
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
