How to Find N Smallest and Largest Items in Python Using HeapQ?

Written by
Vinish Kapoor is a seasoned software development professional and a fervent enthusiast of artificial intelligence (AI). His impressive career spans over 20 years, marked by a relentless pursuit of innovation and excellence in the field of information technology. As an Oracle ACE, Vinish has distinguished himself as a leading expert in Oracle technologies, a title awarded to individuals who have demonstrated their deep commitment, leadership, and expertise in the Oracle community.
  • Python
  • 1 min read

Here is a Python program to find N smallest and largest items in a list using heapq.

Find N Smallest and Largest Items Using HeapQ in Python

import heapq

portfolio = [
   {'name': 'APPLE', 'pieces': 100, 'price': 92.1},
   {'name': 'MANGO', 'pieces': 50, 'price': 542.22},
   {'name': 'GRAPES', 'pieces': 200, 'price': 22.09},
   {'name': 'BANANA', 'pieces': 35, 'price': 34.75},
   {'name': 'PAPAYA', 'pieces': 45, 'price': 15.35},
   {'name': 'PEACH', 'pieces': 75, 'price': 118.65}
]

cheap = heapq.nsmallest(3, portfolio, key=lambda s: s['price'])
expensive = heapq.nlargest(3, portfolio, key=lambda s: s['price'])

print(cheap)
print(expensive)

Output:

[{'name': 'PAPAYA', 'pieces': 45, 'price': 15.35}, {'name': 'GRAPES', 'pieces': 200, 'price': 22.09}, {'name': 'BANANA', 'pieces': 35, 'price': 34.75}]
[{'name': 'MANGO', 'pieces': 50, 'price': 542.22}, {'name': 'PEACH', 'pieces': 75, 'price': 118.65}, {'name': 'APPLE', 'pieces': 100, 'price': 92.1}]

Process finished with exit code 0

See also: