Is a code with less time complexity then space complexity possible?
I recently learnt big O notation, so when I analysed complexities of some example codes, I observed almost all had less memory and more time, so I thought if vice versa is possible
I recently learnt big O notation, so when I analysed complexities of some example codes, I observed almost all had less memory and more time, so I thought if vice versa is possible