Array
Inserting a new item is quite slow // O(N)
Searching is quite fast with binary search // O(logN)
removing an item is slow //O(N)
Inserting a new item is quite slow // O(N)
Searching is quite fast with binary search // O(logN)
removing an item is slow //O(N)