2012-12-21
Jump to navigation
Jump to search
2012-12-21 |
Title text: 2012-12-21 |
Votey[edit]
Explanation[edit]
This explanation is either missing or incomplete. |
Transcript[edit]
This transcript was generated by a bot: The text was scraped using AWS's Textract, which may have errors. Complete transcripts describe what happens in each panel — here are some good examples to get you started (1) (2). |
- [Describe panel here]
- Who can explain frogsort algorithm.
- Start with empty list. For each integer, put that number dead flies in one box. Then put froc in each box. When frog leave box, append that box's fly number to list.
- More fly take longer to eat. When all frogs gone from boxes, list ordered.
- What is maximum step number?
- loging
- (boxes).
- Very good. Now, homework is program frogsort on home frogputer.
- Later
- Bah! Me understand but keep getting off-by-frog- error.
Votey Transcript[edit]
This transcript was generated by a bot: The text was scraped using AWS's Textract, which may have errors. Complete transcripts describe what happens in each panel — here are some good examples to get you started (1) (2). |
- [Describe panel here]
- Note: Today's comic takes place in modern day Northern California
add a comment! ⋅ add a topic (use sparingly)! ⋅ refresh comments!
Discussion
No comments yet!