Thread replies: 10
Thread images: 1
Thread images: 1
File: c++logo.jpg (4KB, 118x118px) Image search:
[Google]
4KB, 118x118px
>> std::sort is fully generic over all containers with guarenteed O(nlog(n)) time complexity.
>> Sorts linked lists in O(n^2log(n) time) because it expects a random access iterator.
Why is the STL so utterly terrible? It's not actually generic by any means, but at the same time it cripples itself on so many points by not including functions that aren't "generic", yet none of the functions in that library even come close to being as generic as your typical Haskell function. Often you end up having to reimplement basic functionality, because the STL's standard function to do this is utterly retarded and unsafe.
Most of the STL "generic" functions actually only work well on a single special case, and are either unsafe or perform poorly on everything else, and the "genericness" of the function is a red herring. Or they fail spectacularily for Vector<Bool>.
>>
>>61638816
i have seen people use text processing tools to duplicate functions for each type instead of using STL, what a bullshit.
>>
>>61638943
Not really, if you care about compile times.
>>
>>61638816
>using linked lists
>using linked lists in generic sort algorithms
OP I'm not sure what you expected.
>>
>>61638986
>cares about compilation time
>uses C++
hmmm
>>
>>61639879
>cares about performance and compilation time
If you're writing some high performance software (Wwise or fmod for example) your coworkers need to compile it as fast as possible. You can surely do it better in JavaScript.
>>
I can't tell when /g/ is trolling or legitimately retarded anymore.
>>
>>61638816
why the fuck would anyone use linked lists?
>>
>>61641610
Because you can expand them, and also they're faster to traverse than arrays on some systems.
>>
>>61638816
>using linked lists
first semester cs babby discovered
Thread posts: 10
Thread images: 1
Thread images: 1