Answered: Reference the image below. (a) Write a…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Reference the image below.
(a) Write a code in python to implement Hoare's algorithm.
(b) Using LArray = {36, 12, 39, 34, 89, 2, 47, 95, 17, 19, 78, 22} as input, display the final
output and the array LArray after it has been manipulated by the algorithm.
(c) Modify the algorithm to display the LArray after each swap done, being sure to indicate
what swap is being observed.

ALGORITHM Hoare Partition (A[1..r])
//Partitions
a subarray by Hoare's algorithm, using the first element
as a pivot
||
//Input: Subarray of array A[0..n-1], defined by its left and right
// indices / and r (l<r)
//Output: Partition of A[..], with the split position returned as
this function's value
//
P← A[l]
il; j<r+1
repeat
repeat i
repeat j
i+ 1 until A[i] ≥ p
j - 1 until A[j] ≤ p
swap(A[i], A[j])
until i j
swap(A[i], A[j]) //undo last swap when i ≥ j
swap(A[1], A[j])
return j

Expert Solution

Step by step

Solved in 8 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions