342: 1337: Part 2 - Revision history

Lettherebedarklight: added Category:Comics with a Spanish translation using HotCat

2025-12-15T09:12:26Z

added Category:Comics with a Spanish translation using HotCat

FaviFake at 10:21, 28 July 2025

2025-07-28T10:21:00Z

FaviFake at 10:15, 28 July 2025

2025-07-28T10:15:33Z

FaviFake: added Category:Comics featuring real people using HotCat

2025-05-11T10:11:49Z

added Category:Comics featuring real people using HotCat

FaviFake: /* Trivia */

2025-05-11T09:31:22Z

‎Trivia

Kynde at 20:51, 10 February 2025

2025-02-10T20:51:56Z

Kynde at 20:50, 10 February 2025

2025-02-10T20:50:51Z

Dúthomhas: Big O is upper bounds, not upper and lower. (Big Omega is lower bounds. Big Theta is upper and lower when upper and lower are the same.)

2024-08-30T16:09:48Z

Big O is upper bounds, not upper and lower. (Big Omega is lower bounds. Big Theta is upper and lower when upper and lower are the same.)

172.70.115.159: /* Transcript */

2024-03-29T16:27:55Z

‎Transcript

Firestar233: grammar policing

2023-10-23T02:18:22Z

grammar policing

← Older revision		Revision as of 09:12, 15 December 2025
Line 69:		Line 69:
	[[Category:Comics featuring children]]		[[Category:Comics featuring children]]
	[[Category:Comics featuring real people]]		[[Category:Comics featuring real people]]
		+	[[Category:Comics with a Spanish translation]]

@@ Line 67: / Line 67: @@
 [[Category:Multiple Cueballs]] <!-- first panel -->
 [[Category:Computers]]
-[[Category:Children]]
+[[Category:Comics featuring children]]
 [[Category:Comics featuring real people]]

@@ Line 67: / Line 67: @@
 [[Category:Multiple Cueballs]] <!-- first panel -->
 [[Category:Computers]]
-[[Category:Kids]]
+[[Category:Children]]
 [[Category:Comics featuring real people]]

← Older revision		Revision as of 10:11, 11 May 2025
Line 68:		Line 68:
	[[Category:Computers]]		[[Category:Computers]]
	[[Category:Kids]]		[[Category:Kids]]
		+	[[Category:Comics featuring real people]]

@@ Line 54: / Line 54: @@
 ==Trivia==
-*In this [https://www.youtube.com/watch?v=zJOS0sV2a24#t=21m30s Google-speech] Donald Knuth personally asked [[Randall]] what his ''n*log(log(n))'' algorithm for searching was, and Randall referred him to Elaine.
+In [https://www.youtube.com/watch?v=zJOS0sV2a24#t=21m30s this Google speech], [[Donald Knuth]] personally asked [[Randall]] what his ''n*log(log(n))'' algorithm for searching was, and Randall referred him to Elaine.
 {{comic discussion}}

@@ Line 63: / Line 63: @@
 [[Category:Comics featuring Cueball]]
 [[Category:Comics featuring Elaine Roberts]]
-[[Category:Comics featuring Comics featuring Little Bobby Tables]]
+[[Category:Comics featuring Little Bobby Tables]]
 [[Category:Comics featuring Mrs. Roberts]]
 [[Category:Comics featuring Donald Knuth]]

@@ Line 17: / Line 17: @@
 * [[345: 1337: Part 5]]
-"Like a ring in a bell" appears to be a reference to the {{w|Chuck Berry}} song {{w|Johnny B. Goode}}, in which Berry describes a young boy (like himself) who becomes a guitar-playing prodigy. The original lyric was "just like a-ringing a bell." Apparently, [[Help I'm trapped in a driver's license factory Elaine Roberts|Elaine Roberts]] learned to program as quickly, easily, and skillfully as Johnny (and Chuck) learned to play rock 'n' roll.
+"Like a ring in a bell" appears to be a reference to the {{w|Chuck Berry}} song {{w|Johnny B. Goode}}, in which Berry describes a young boy (like himself) who becomes a guitar-playing prodigy. The original lyric was "just like a-ringing a bell." Apparently, [[Elaine Roberts]] learned to program as quickly, easily, and skillfully as Johnny (and Chuck) learned to play rock 'n' roll.
 [[Donald Knuth]] is a computer science Professor Emeritus at {{w|Stanford University}} who is famous for writing {{w|The Art of Computer Programming}} and developing the <span class="texhtml"><span style="font-family:cmr10, LMRoman10-Regular, Times, serif;">T<span style="text-transform:uppercase; vertical-align:-0.5ex; margin-left:-0.1667em; margin-right:-0.125em;">e</span>X</span></span> computerized typesetting system. He may not have a mountain hideaway (a reference to ''{{w|Kill Bill}}'', by the way, as is the whole training sequence), but he would be one of the best mentors a budding hacker could have.
@@ Line 62: / Line 62: @@
 [[Category:Comics sharing name|1337]]
 [[Category:Comics featuring Cueball]]
-[[Category:Comics featuring Help I'm trapped in a driver's license factory Elaine Roberts]]
+[[Category:Comics featuring Elaine Roberts]]
-[[Category:Comics featuring Robert'); DROP TABLE Students;--]]
+[[Category:Comics featuring Comics featuring Little Bobby Tables]]
 [[Category:Comics featuring Mrs. Roberts]]
 [[Category:Comics featuring Donald Knuth]]

@@ Line 20: / Line 20: @@
 [[Donald Knuth]] is a computer science Professor Emeritus at {{w|Stanford University}} who is famous for writing {{w|The Art of Computer Programming}} and developing the <span class="texhtml"><span style="font-family:cmr10, LMRoman10-Regular, Times, serif;">T<span style="text-transform:uppercase; vertical-align:-0.5ex; margin-left:-0.1667em; margin-right:-0.125em;">e</span>X</span></span> computerized typesetting system. He may not have a mountain hideaway (a reference to ''{{w|Kill Bill}}'', by the way, as is the whole training sequence), but he would be one of the best mentors a budding hacker could have.
-The {{w|A* search algorithm}} and {{w|Dijkstra's algorithm}} are {{w|Graph traversal|graph search}} {{w|algorithm}}s. And what study of algorithms would be complete without a healthy study about finding complexities? {{w|Computational complexity theory|Time complexity}} is the amount of time an algorithm takes to execute. Upper and lower bounds for complexity is written in {{w|Big O notation}}. Best possible execution of an algorithm is constant time, or O(1), said in words, for any given data set, no matter how large, the algorithm will always return the answer at the same time. However, constant time is extremely difficult to achieve; linear time (O(n)) is also very good. For more complex algorithms, [https://www.wolframalpha.com/input/?i=plot+x*log%28x%29 O( n*log(n) )] is good, but [https://www.wolframalpha.com/input/?i=plot+x*log%28log%28x%29%29 O( n*log(log(n)) )] is better. (Note that logarithms in different bases are proportional to each other. So, this would hold true for any base >1.)
+The {{w|A* search algorithm}} and {{w|Dijkstra's algorithm}} are {{w|Graph traversal|graph search}} {{w|algorithm}}s. And what study of algorithms would be complete without a healthy study about finding complexities? {{w|Computational complexity theory|Time complexity}} is the amount of time an algorithm takes to execute. Upper bounds for complexity is written in {{w|Big O notation}}. Best possible execution of an algorithm is constant time, or O(1), said in words, for any given data set, no matter how large, the algorithm will always return the answer at the same time. However, constant time is extremely difficult to achieve; linear time (O(n)) is also very good. For more complex algorithms, [https://www.wolframalpha.com/input/?i=plot+x*log%28x%29 O( n*log(n) )] is good, but [https://www.wolframalpha.com/input/?i=plot+x*log%28log%28x%29%29 O( n*log(log(n)) )] is better. (Note that logarithms in different bases are proportional to each other. So, this would hold true for any base >1.)
 Knowing that [[Mrs. Roberts]] has two children, this daughter named Elaine and the son named Bobby, is the key indicator that this is the mother previously noted as having given her children particularly strange names. Of course, the title text here explains that Elaine is only her middle name (assuming canonicity of title-text), but it was in the title text to [[327: Exploits of a Mom]] that we learned that her first name is "Help I'm trapped in a driver's license factory". Mrs. Roberts appears to have had fun naming her children.

@@ Line 25: / Line 25: @@
 ==Transcript==
-:[Cueball standing an looking down at his Cueball-like friend, who is sitting on the floor near an armchair holding a cloth to his face.]
+:[Cueball standing and looking down at his Cueball-like friend, who is sitting on the floor near an armchair holding a cloth to his face.]
 :Friend: So the greatest hacker of our era is a cookie-baking mom?
 :Cueball: Second-greatest.

@@ Line 8: / Line 8: @@
 ==Explanation==
-This is the second part of five in the "[[:Category:1337|1337]]" series. The title 1337 is "L-eet," or "elite," using the {{w|Leet}} alphabet, a coding system used primarily on the internet (and on early text messaging system), meant to provide a bit of {{w|obfuscation}} to plain text both to make it harder to read and to show off in a creative way using in-group jargon.
+This is the second part of five in the "[[:Category:1337|1337]]" series. The title 1337 is "L-eet," or "elite," using the {{w|Leet}} alphabet, a coding system used primarily on the internet (and on early text messaging systems), meant to provide a bit of {{w|obfuscation}} to plain text both to make it harder to read and to show off in a creative way using in-group jargon.
 This series was released on five consecutive days (Monday to Friday) and not over the usual schedule of three comics a week. These are all the comics in [[:Category:1337|1337 series]]: