That moment you realise you may have made a syntax error

Content Filipe Fortes fortes Follow Debugging is like being the detective in a crime movie where you are also the murderer. 6:57 PM - 9 Nov 2013 V 9,489 Retweets 6,320 Likes 280 17 9.5K 6.3K

Content Senior dev explaining to junior dev how the legacy project is still running after 25 years 11 ePISoDe 12

Content Brenan Keller brenankeller A QA engineer walks into a bar. Orders a beer. Orders 0 beers. Orders 99999999999 beers. Orders a lizard. Orders -1 beers. Orders a ueicksjdhd. First real customer walks in and asks where the bathroom is. The bar bursts into flames, killing everyone. 1:21 PM 30 Nov 18 Q L

Content Claudia Pellegrino pellegrino 2d Replying to tmobileat PWTooStrong and Telekomhilft Thanks for your reply Andrea! Storing cleartext passwords in a database is a naughty thing to do. plaintextoffenders.comfaqdevs What can we do to get your devs to fix that? 95 1797 1,590 T-Mobile Austria tmobileat 2d Hi pellegrino, I really do not get why this is a problem. You have so many passwords for evey app, for every mail- account and so on. We secure all data very carefully, so there is not a thing to fear. Kthe 268 17310 271 Eric Korni22 1d Well, what if your infrastructure gets breached and everyone's password is published in plaintext to the whole wide world? V 1762 1,321 1 T-Mobile Austria tmobileat 1d Korni22 What if this doesn't happen because our security is amazingly good? Kthe V Hackers Stole Personal Data of 2 Million T- Mobile Customers motherboard. vice.com

Content Bae: Come over Dijkstra: But there are so many routes to take and I don't know which one's the fastest Bae: My parents aren't home Dijkstra: Dijkstra's algorithm Graph search algorithm Not to be confused with Dykstra's projection algorithm. Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edger W. Dikstra in 1956 and published three years later. 12) The algorithm exists in many variants; Dijkstra's original variant found the shortest path between two nodes, 2) but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. A Dijkstra's algorithm 14 Out

Content When you attempt to use breakpoints for debugging. Why are you running?