Hacker Read
top
|
best
|
new
|
newcomments
|
leaders
|
about
|
bookmarklet
login
yxhuvud | karma 3427 | avg karma 1.76
2016-10-29 07:31:31+00:00
|
next
[–]
update item
Malloc is O(n²) so it totally depend on how able you are to not do gradual allocation.
reply
view as:
tree
latest_first
faragon | karma 1122 | avg karma 1.25
2016-10-29 08:08:06+00:00
|
next
[–]
similar comments
In most C libraries malloc() is O(log n), e.g. when implemented as balanced trees.
reply
yxhuvud | karma 3427 | avg karma 1.76
2016-10-30 07:12:12+00:00
|
next
[–]
similar comments
Argh. True, sorry for the brainfart.
reply
Legal
|
privacy
reply