Answered: Suppose you were asked to enhance the…

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

100%

Suppose you were asked to enhance the following bubble sorting Kotlin program to enforce more functional features which will be stated at the end of this naïve program:

fun bubbleSort(values: IntArray) {

for (i in values.size - 1 downTo 0) {

for (j in 0 until i) {

if (values[j] > values[j + 1]) {

swap(values, j, j + 1)

}

}
fun main() {

val array = intArrayOf(10, 5, 2, 7, 8, 3)

bubbleSort(array)
array.printAll()

}

Which will output the sorted array: 2 3 5 7 8 10

Now modify the above program:

1. To be more generic which can sort any type and not only integers

2. Add a method to make this generic bubble sort provide results in descending way

3. Modify the generic bubble sort in (1) to be a recursive one.

If we take a closer look at Bubble Sort algorithm, we can notice that in first pass, we move largest element to end (Assuming sorting in increasing order). In second pass, we move second largest element to second last position and so on.
Recursion Bubble Sort Idea.

Base Case: If array size is 1, return.
Do One Pass of normal Bubble Sort. This pass fixes last element of current subarray.
Recur for all elements except last of current subarray.

Expert Solution

Step by step

Solved in 3 steps with 2 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