#3017: change-folder: tab-completion results in "Out of memory!", return value = 1 if many files for the menu
Comment (by vinc17): Perhaps you can waste some memory with a geometric progression compared to an arithmetic progression (but this is not obvious, as the fragmentation may be lower), but the time complexity should be better. I'd say O(n) instead of O(n^2^). See [http://en.wikipedia.org/wiki/Dynamic_array]. But all this depends on the malloc routine and how blocks are allocated. -- Ticket URL: <http://dev.mutt.org/trac/ticket/3017#comment:7>
