Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
def second largest(lst: List[int]) -> int: Given a list of integers, return the second largest item in the list without modifying . You cannot use any of python's builtin sorting functions. Do not attempt to sort the list yourself either. As a sanity check, you can ensure that your function returns what "return sorted (lst)[-2]" would. (DO NOT COPY THIS) For example, an input [1, 2, 3] should return an output of 2, since 2 is the second largest integer in the list. Note that when we say second largest, we do not mean second largest distinct element. That means that [1, 2, 4, 4] should return 4, not 2. Precondition: the input list has at least 2 elements. Something extra to think about (not graded): is it possible to write this function with an extra argument and return the nth largest number in the list? Can you do this without sorting the list?

def second largest(lst: List[int]) -> int: Given a list of integers, return the second largest item in the list without modifying . You cannot use any of python's builtin sorting functions. Do not attempt to sort the list yourself either. As a sanity check, you can ensure that your function returns what "return sorted (lst)[-2]" would. (DO NOT COPY THIS) For example, an input [1, 2, 3] should return an output of 2, since 2 is the second largest integer in the list. Note that when we say second largest, we do not mean second largest distinct element. That means that [1, 2, 4, 4] should return 4, not 2. Precondition: the input list has at least 2 elements. Something extra to think about (not graded): is it possible to write this function with an extra argument and return the nth largest number in the list? Can you do this without sorting the list?

Database System Concepts
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
icon
Related questions
Question

You must not use any of the following:

 

  • dictionaries or dictionary methods
  • try-except
  • break and continue statements
  • recursion
  • map / filter
  • any type of sorting function for second_largest
def second_largest(lst: List[int]) -> int: II II II Given a list <lst> of integers, return the second largest item in the list without modifying <lst>. You cannot use any of python's builtin sorting functions. Do not attempt to sort the list yourself either. As a sanity check, you can ensure that your function returns what "return sorted (lst)[-2]" would. (DO NOT COPY THIS) For example, an input [1, 2, 3] should return an output of 2, since 2 is the second largest integer in the list. Note that when we say second largest, we do not mean second largest distinct element. That means that [1, 2, 4, 4] should return 4, not 2. Precondition: the input list has at least 2 elements. Something extra to think about (not graded): is it possible to write this function with an extra argument <n> and return the nth largest number in the list? Can you do this without sorting the list? pass
Transcribed Image Text:def second_largest(lst: List[int]) -> int: II II II Given a list <lst> of integers, return the second largest item in the list without modifying <lst>. You cannot use any of python's builtin sorting functions. Do not attempt to sort the list yourself either. As a sanity check, you can ensure that your function returns what "return sorted (lst)[-2]" would. (DO NOT COPY THIS) For example, an input [1, 2, 3] should return an output of 2, since 2 is the second largest integer in the list. Note that when we say second largest, we do not mean second largest distinct element. That means that [1, 2, 4, 4] should return 4, not 2. Precondition: the input list has at least 2 elements. Something extra to think about (not graded): is it possible to write this function with an extra argument <n> and return the nth largest number in the list? Can you do this without sorting the list? pass
LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. You may not use any dictionaries or dictionary methods. Do not use try-except statements, you should be able to anticipate or prevent any errors from happening at all! from typing import Any, List
Transcribed Image Text:LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. You may not use any dictionaries or dictionary methods. Do not use try-except statements, you should be able to anticipate or prevent any errors from happening at all! from typing import Any, List
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Lists
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS