It's because it is not proven that element with the index 1 exists. Even TypeScript enforces bounds checking these days.

As for the first one - as i understand, this will spoil the original array, as it is assigned by reference; so by writing the string into `numbersOrStrings`, you also write it into `numbers`, thus violating the type.

lshevtsov

·9 वर्ष पहले·discuss

But why didn’t you give her the ice cream in the first place? Perhaps, because of a rule? Perhaps that rule was not so bad after all?

lshevtsov

·11 वर्ष पहले·discuss

I made an implementation of this algorithm as a university assignment;

here's a vanilla implementation of Quicksort https://github.com/leonid-shevtsov/uni-programming/blob/mast...

and here's the function to generate data that causes the custom implementation to go O(n^2) https://github.com/leonid-shevtsov/uni-programming/blob/mast...

lshevtsov

·11 वर्ष पहले·discuss

This reminded me of Dogma 95, a similar manifesto for film directors. https://en.wikipedia.org/wiki/Dogme_95

It's not practical, but something uniquely valuable can be grown from the constraints.

lshevtsov

·11 वर्ष पहले·discuss

Or better yet, search right from the location bar of any modern browser, without any intermediary pages.