Python’s list method sort includes the keyword argument reverse, whose default value is False. The programmer can override this value to sort a list in descending order. Modify the selectionSort function discussed in this chapter so that it allows the programmer to supply this additional argument (as the second parameter) to redirect the sort. ----------------------------------------------------------------------------------- def selectionSort(lyst): """Sorts the items in lyst in ascending order.""" i = 0 while i < len(lyst) - 1: # Do n – 1 searches minIndex = i # for the smallest item j = i + 1 while j < len(lyst): # Start a search if lyst[j] < lyst[minIndex]: minIndex = j j += 1 if minIndex != i: # Swap if necessary swap(lyst, minIndex, i) i += 1 def swap(lyst, x, y): """Exchanges the elements at positions x and y.""" lyst[x], lyst[y] = lyst[y], lyst[x] def main(): """Tests with four lists.""" lyst = [2, 4, 3, 0, 1, 5] selectionSort(lyst) print(lyst) lyst = list(range(6)) selectionSort(lyst) print(lyst) lyst = [2, 4, 3, 0, 1, 5] selectionSort(lyst, reverse = True) print(lyst) lyst = list(range(6)) selectionSort(lyst, reverse = True) print(lyst) if name == "main": main()

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

Python’s list method sort includes the keyword argument reverse, whose default value is False. The programmer can override this value to sort a list in descending order.

Modify the selectionSort function discussed in this chapter so that it allows the programmer to supply this additional argument (as the second parameter) to redirect the sort.

-----------------------------------------------------------------------------------

def selectionSort(lyst):

"""Sorts the items in lyst in ascending order."""

i = 0

while i < len(lyst) - 1: # Do n – 1 searches

minIndex = i # for the smallest item

j = i + 1

while j < len(lyst): # Start a search

if lyst[j] < lyst[minIndex]:

minIndex = j

j += 1

if minIndex != i: # Swap if necessary

swap(lyst, minIndex, i)

i += 1

def swap(lyst, x, y):

"""Exchanges the elements at positions x and y."""

lyst[x], lyst[y] = lyst[y], lyst[x]

def main():

"""Tests with four lists."""

lyst = [2, 4, 3, 0, 1, 5]

selectionSort(lyst)

print(lyst)

lyst = list(range(6))

selectionSort(lyst)

print(lyst)

lyst = [2, 4, 3, 0, 1, 5]

selectionSort(lyst, reverse = True)

print(lyst)

lyst = list(range(6))

selectionSort(lyst, reverse = True)

print(lyst)

if __name__ == "__main__":

main()

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 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