Python Data Structure: Get the two largest and three smallest items from a dataset
Python Data Structure: Exercise-10 with Solution
Write a Python program to get the two largest and three smallest items from a dataset.
Sample Solution:
Python Code:
import heapq
h = [10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100]
print(heapq.nlargest(2,h))
print(heapq.nsmallest(3,h))
Sample Output:
[100, 90] [10, 20, 20]
Flowchart:
Python Code Editor:
Contribute your code and comments through Disqus.
Previous: Write a Python program to create a heapsort, pushing all values onto a heap and then popping off the smallest values one at a time.
Next: Write a Python program to locate the left insertion point for a specified value in sorted order.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.
https://www.w3resource.com/python-exercises/data-structures-and-algorithms/python-data-structure-exercise-23.php
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics