Sarah Lim (http://sarahlim.com/eecs-111)
In most countries, the age of majority is 18. Some countries have different laws. In Scotland, for instance, the age of majority is 16.
Suppose we want to write a program to determine whether someone is a legal adult. We'll write a global version that works for most countries, and a Scotland-specific version.
| // http://loremipsumgenerator.com | |
| // in an extension background script | |
| // endpoint.target is the current debugging target | |
| // triggers 'Aw, Snap' | |
| chrome.debugger.sendCommand(endpoint.target, 'DOM.getDocument', {}, ({ root }) => { | |
| chrome.debugger.sendCommand(endpoint.target, 'DOM.querySelector', { nodeId: root.nodeId, selector: 'footer' }, ({ nodeId }) => { | |
| chrome.debugger.sendCommand(endpoint.target, 'CSS.getMatchedStylesForNode', { nodeId: nodeId }, (styles) => { | |
| console.log(styles); | |
| }); |
| struct Tree<'a> { | |
| pawns: Vec<usize>, | |
| rolls: Vec<usize>, | |
| pawns_iter: std::slice::Iter<'a, usize>, | |
| rolls_iter: std::slice::Iter<'a, usize>, | |
| } | |
| impl<'a> Tree<'a> { | |
| fn new(pawns: Vec<usize>, rolls: Vec<usize>) -> Tree<'a> { | |
| Tree { |
| use std::sync::{Arc, Mutex}; | |
| use std::thread; | |
| use std::sync::mpsc; | |
| fn main() { | |
| let v = vec![1, 2]; | |
| println!("{:?}", v.iter().map(|x| x.to_string()).collect::<Vec<_>>().join(" ")); | |
| let mut iter = (0..4).zip((0..6)); | |
| for (x, y) in iter { |
Sarah Lim (slim at u.northwestern.edu)
Last updated 24 April 2016
To measure an algorithm's efficiency, one intuitive idea is to consider the amount of time it takes to solve a problem (transform the input into the desired output).
Unfortunately, it's difficult to measure the exact runtime of an algorithm. In practice, runtimes are influenced by a lot of factors unrelated to the algorithm itself. For instance, the same function might run quickly on a state-of-the-art gaming PC, and much more slowly on an ancient Windows 98 machine.
| #![allow(dead_code)] | |
| extern crate rand; | |
| use rand::Rng; | |
| use std::sync::{Arc, Mutex}; | |
| // use std::time::Duration; | |
| use std::thread; | |
| use std::sync::mpsc; | |
| fn partition(arr: &mut [i32]) -> usize { |
| { | |
| // Evaluate file in the open SublimeREPL. | |
| // Depends on you creating the Packages/User/EvalInREPL.sublime-macro file. | |
| { "keys": ["super+r"], "command": "run_macro_file", "args": { "file": "Packages/User/EvalInREPL.sublime-macro" }, | |
| "context": [ | |
| { "key": "selector", "operator": "equal", "operand": "source.elm" } | |
| ] | |
| }, | |
| // Reindent selection on tab |
| ;; Conditionals | |
| (require 2htdp/image) | |
| (require cs111/iterated) | |
| ;; boolean is one of | |
| ;; - true (#true, #t) | |
| ;; - false (#false, #f) | |
| ;; and : boolean, boolean, ... -> boolean |