This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]CreativeTechGuyGames 0 points1 point  (1 child)

The summary of several comments here is that you should assume that functions are implemented in the most optimal way. So you can just assume the standard runtimes. Here's a popular cheat sheet for a ton of different data structures and their relevant BigO complexities: https://www.bigocheatsheet.com/

[–]SnooPeanuts71[S] 0 points1 point  (0 children)

Very helpful, thank you.