在postgres中使用top-N heapsort来理解顺序

In a theoretical scenario in the absence of indexes, an order by with limit has to scan all the data, then apply the order by and then only apply the limit since we can get the top 10 rows(for example) only after sorting.In a theoretical scenario in the absence of ind