Simple performance measure test for Heapq.nlargest vs sort() in Python

heapq_vs_sort.py

def naive_find_top_k(values, k=20):
    values.sort(reverse=True)
    return values[:k]
 
 
import heapq
def heap_find_top_k(values, k=20):
    return heapq.nlargest(k, values)

import random
randomlist = []
for i in range(0,10_000_000):
	n = random.randint(1,30)
	randomlist.append(n)

import time
start_time = time.time()
print( naive_find_top_k(randomlist) )
print("SORT --- %s sec" % (time.time() - start_time))

start_time = time.time()
print( heap_find_top_k(randomlist) )
print("HEAPQ --- %s sec" % (time.time() - start_time))