w3resource

Python: Find the three largest integers from a given list of numbers using Heap queue algorithm


Write a Python program to find the three largest integers from a given list of numbers using the heap queue algorithm.

Sample Solution:

Python Code:

import heapq as hq
nums_list = [25, 35, 22, 85, 14, 65, 75, 22, 58]
print("Original list:")
print(nums_list)
# Find three largest values
largest_nums = hq.nlargest(3, nums_list)
print("\nThree largest numbers are:", largest_nums)

Sample Output:

Original list:
[25, 35, 22, 85, 14, 65, 75, 22, 58]

Three largest numbers are: [85, 75, 65]  

Flowchart:

Python heap queue algorithm: Find the three largest integers from a given list of numbers using Heap queue algorithm.

Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Python heap queue algorithm Exercise Home.
Next: Write a Python program to find the three smallest integers from a given list of numbers using Heap queue algorithm.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Follow us on Facebook and Twitter for latest update.