Hash table - Wikiwand Tip The nice thing about hash tables is that most algorithms are O(1) unless hash collisions occur. AlgorithmAverageWorst caseSpaceΘ(n)O(n)SearchΘ(1)O(n)InsertΘ(1)O(n)DeleteΘ(1)O(n)