min heapify ejemplo de código de Python

Presta atención ya que en esta división vas a encontrar el arreglo que buscas.

Ejemplo: python heapq

>>>import heapq
>>> heap =[]>>> heapq.heappush(heap,(5,'write code'))>>> heapq.heappush(heap,(7,'release product'))>>> heapq.heappush(heap,(1,'write spec'))>>> heapq.heappush(heap,(3,'create tests'))>>> heapq.heappop(heap)#pops smallest(1,'write spec')>>> heapq.nlargest(2,heap)#displays n largest values without popping[(7,'release product'),(5,'write code')]>>> heapq.nsmallest(2,heap)#displays n smallest values without popping[(3,'create tests'),(5,'write code')]>>> heap =[1,3,5,7,9,2,4,6,8,0]>>> heapq.heapify(heap)#converts a list to heap>>> heap
[0,1,2,6,3,5,4,7,8,9]>>>defheapsort(iterable):...     h =[]...for value in iterable:...         heappush(h, value)...return[heappop(h)for i inrange(len(h))]...>>> heapsort([1,3,5,7,9,2,4,6,8,0])[0,1,2,3,4,5,6,7,8,9]

Si para ti ha sido de ayuda nuestro artículo, sería de mucha ayuda si lo compartes con el resto juniors y nos ayudes a difundir nuestra información.

---

---

Utiliza Nuestro Buscador