You are viewing a single comment's thread. Return to all comments →
import bisect listt = [] mid = 0 for i in range(n): bisect.insort(listt,a[i]) if (i+1)%2==0: print('{:0.1f}'.format((listt[mid]+listt[mid-1])/2)) else: print('{:0.1f}'.format(listt[mid])) mid+=1
Seems like cookies are disabled on this browser, please enable them to open this website
Heaps: Find the Running Median
You are viewing a single comment's thread. Return to all comments →