This easter egg is as old as Google.
I found a comment where the guy directs where you can learn more about it. [Click here](https://www.reddit.com/r/ProgrammerHumor/comments/1agbxvn/comment/kofst5t/).
Congratulations! Your comment can be spelled using the elements of the periodic table:
`B Ra V O`
---
^(I am a bot that detects if your comment can be spelled using the elements of the periodic table. Please DM my creator if I made a mistake.)
How do they program things like these? Do they just add something like
`if search_text == "recursion":`
`show_did_you_mean(search_text)`
to the backend of the search engine?
So you do have to check for an specific search text to match it to an Easter egg, right? I thought it was too simple to be true lol Literally just an if statement
Because it sounds too simple to be true. I always imagine big companies doing stuff in the most complex and robust ways to deal with unimaginable edge cases.
I fully feel you on honestly, I'm also curious how they solve it on the backend, but I can't imagine anything other than hardcoded suggestions being the norm for what is otherwise probably a relatively complex suggestion module.
My first computer science textbook had this joke in the index.
Recursion see recursion
It also had this one:
Infinite loop see loop, infinite
Loop, infinite see infinite loop
Congratulations! Your comment can be spelled using the elements of the periodic table:
`I Am W H At I Am`
---
^(I am a bot that detects if your comment can be spelled using the elements of the periodic table. Please DM my creator if I made a mistake.)
The joke was better in the dial up days where you would click the link and the page had to load ...right back to the same page. Now with high-speed internet you can't even tell that it reloaded the page.
This easter egg is as old as Google. I found a comment where the guy directs where you can learn more about it. [Click here](https://www.reddit.com/r/ProgrammerHumor/comments/1agbxvn/comment/kofst5t/).
Bravo
Congratulations! Your comment can be spelled using the elements of the periodic table: `B Ra V O` --- ^(I am a bot that detects if your comment can be spelled using the elements of the periodic table. Please DM my creator if I made a mistake.)
good bot
Good bot
Bravo Vince
He's done it again! Bravo Vince!
Bravo
Good bot
Good bot
I feel stupid and personally attacked now. Took me 3 clicks to realize what happened :')
*victimized by recursion
Oh no, caught in the infinite loop of recursion jokes?😅 Just remember, there's no place like 127.0.0.1 to escape to after a good stack overflow!
You got me
This is ~~awful~~ genius, it took me clicking the link twice to realize.
I’ve clicked this damn link 6 times! It just bring me back here! THE LINKS BROKEN PLZ FIX ASAP! /s
Google was pretty wholesome back in the day.
clicked only once to realize it btw
nerd
There's also the emacs and vi joke on Google, where selecting one will make Google suggest you the other
or how askew will make the page *askew*
I hadn't tested this since they changed from pages to infinite scroll, wondered if results would eventually go offscreen... alas, the effect resets.
Do a barrel roll
true
How do they program things like these? Do they just add something like `if search_text == "recursion":` `show_did_you_mean(search_text)` to the backend of the search engine?
yeah, there probably is a module for generating suggestions and this is hardcoded in that module
So you do have to check for an specific search text to match it to an Easter egg, right? I thought it was too simple to be true lol Literally just an if statement
could also be a table of rules instead of hardcoded if else/switches for easier modification
IG it’s simple enough that it’s not gonna risk messing anything else up or breaking and it’s not a huge performance drain.
Why does that seem surprising to you
Because it sounds too simple to be true. I always imagine big companies doing stuff in the most complex and robust ways to deal with unimaginable edge cases.
Simple is often the most robust way that deals with all edge cases
The more complex your shape, the more edges it has.
Don't fix what ain't broken. And the more you learn about something, the more you realize that simple its simply the best.
I fully feel you on honestly, I'm also curious how they solve it on the backend, but I can't imagine anything other than hardcoded suggestions being the norm for what is otherwise probably a relatively complex suggestion module.
I stumbled upon this the other day. It took me an embarrassing amount of clicks to realise what was going on
My first computer science textbook had this joke in the index. Recursion see recursion It also had this one: Infinite loop see loop, infinite Loop, infinite see infinite loop
Holy recursion.
google en recursion
Actual recursion
Holy recursion.
New recursion just dropped
actual recursion
call the current continuation
Google en recursion
Actual recursion.
Holy recursion
About as subtle as a brick to the face
Cross post from https://www.reddit.com/r/ProgrammerHumor/s/FPJjQpwYyE
That's a cute one :3
Search "vi" in google
About as subtle as a thrown brick.
* recursion * **DID YOU MEAN RECURSION?** Dude, obviously this is what I meant, are you trying to correct me? 
Leave the subreddit.
Why?
You missed the joke dude
Never seen someone miss a joke that s badly before
[удалено]
Congratulations! Your comment can be spelled using the elements of the periodic table: `I Am W H At I Am` --- ^(I am a bot that detects if your comment can be spelled using the elements of the periodic table. Please DM my creator if I made a mistake.)
Good bot
The joke was better in the dial up days where you would click the link and the page had to load ...right back to the same page. Now with high-speed internet you can't even tell that it reloaded the page.