2 ms·
Bang sort requires O(M*N) storage, where M is size of the elements.
by 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.