u/raresaturn

Have not watched this since the 80’s. And had mercifully erased the Doctor in the shower from my memory. Now it’s back

Hypothetically, if you are inside a black hole and you shine a light or laser directly up, would the light slow down and reverse like a thrown object?

Stars fuse lighter elements into heavier ones due to their intense gravity and pressure, could black holes be doing the same thing? Could anything that falls into a black hole be turned into an element at the far end of the periodic table, one that we have not discovered or named yet? Would this make Hawking radiation just regular radioactivity for super heavy elements? What would the atomic number for such an element be?

What on Earth were they thinking? Apart from the fact that nobody on Earth could mistake that for a real gorilla, the scene in question would be far more at home in something like Porkys 2. Kind of distracts from the social commentary of the piece. Still a great film though, worth another watch.

I am nominally a 500-600 ELO player, but lately I've been matched with a lot of smurfs who are clearly 1000+. consequently I have dropped to below 400. It is soul-destroying and frankly makes me want to give up the game. I've watched a lot of youtube videos and I know what a 1000+ player looks like, and I know what a LEL looks like. What can be done about these players who deliberately seek out players much lower than they are. How is that even fun? I don't understand it. If there anything that can do done by the devs to fix this?

I was trying to find the fastest algorithm for finding a duplicate between two lists (ie same element exists in both lists) and Google tells me that the best way is making a hash table. But this takes a lot of extra memory. So I came up with a new solution that is at worst O(n) with no extra memory requirements.
Firstly, if the lists are unsorted then sort them. We'll call them lists A & B. Get first value of list A. Go to first value in list B that is not less than current value. Then go to the next value in list A that is not less than current value. Go back and forth between lists. If there is a duplicate you will go directly to/from the same value in both lists. example:
A B
1 4
3 5
7 9
11 13
15 14
17 18
18 21
..
So the sequence here is 1,4,7,9,11,13,15,18,18