4 ms·

Given that storing n items in an array or a similar structure requires O(n) space, the space requirement of bang sort seems normal. Perhaps by making use of th

Given that storing n items in an array or a similar structure requires O(n) space, the space requirement of bang sort seems normal. Perhaps by making use of the Oracle of Delphi, you could do away with the array. Also, the energy requirements... Wouldn't they be proportional to the number of operations required, i.e. the time complexity?

lupire 5y ago
Bang sort requires O(M*N) storage, where M is size of the elements.
- hibbelig 5y ago
  > Bang sort requires O(MN) storage, where M is size of the elements. Very good point! Computer-based algorithms need O(log(M) N) storage, I guess.