Home
Search For Notes
All Search Criteria Are Optional
After:Before:
In Course:
Contains String:
0 1 2 3 4 5 6 7 8
Date tag: January 26 2010 5:53:33
Click here to add notes.
Date tag: January 26 2010 5:50:9
Click here to add notes.
Date tag: January 26 2010 5:47:49
Click here to add notes.
Date tag: January 26 2010 5:43:30
Click here to add notes.
Date tag: January 26 2010 5:39:3
Click here to add notes.
Date tag: January 26 2010 5:38:49
Click here to add notes.
Date tag: January 26 2010 5:38:38
Click here to add notes.
Date tag: January 26 2010 5:34:45
Click here to add notes.
Date tag: January 26 2010 5:28:50
Collector Variables: A functional programming idiom, not a cheat, that can greatly improve efficiency sometimes. The idea is to use an extra variable to build up the answer as we go along. Start collector variables with a default value of 1 or 0 for numbers, and empty for lists.
Date tag: January 26 2010 5:28:40
O N where N is the length of l. That said there is a library function called append that probably cheats and does append in constant time. If we had a pointer to the end of each list, we could implement append in constant time. We canot do this using normal scheme functional programming.
Date tag: January 26 2010 5:23:24
Click here to add notes.
Date tag: January 26 2010 5:16:10
Mergesort is a single composed function call, merge singles is O n and it is called only once. Mergesort helper starts with N singleton lists and maps pairs until only one list remains which implies O log n calls. Each call to mergersort helper results in calls to mnp that touch once more each element once per round, O n time. So the overall complexity is O n plus N times log n
Date tag: January 26 2010 5:5:39
Click here to add notes.
Date tag: January 26 2010 5:3:32
Click here to add notes.
Date tag: January 21 2010 6:19:8
Click here to add notes.
Date tag: January 21 2010 6:18:58
Click here to add notes.
Date tag: January 21 2010 6:16:0
Click here to add notes.
Date tag: January 21 2010 6:15:50
Click here to add notes.
Date tag: January 21 2010 6:10:48
Click here to add notes.
Date tag: January 21 2010 6:4:13
Click here to add notes.
Date tag: January 21 2010 6:4:3
Click here to add notes.
Date tag: January 21 2010 5:59:10
Click here to add notes.
Date tag: January 21 2010 5:55:14
merge sort in scheme
Date tag: January 21 2010 5:48:5
Click here to add notes.
Date tag: January 21 2010 5:47:58
Click here to add notes.
Date tag: January 21 2010 5:42:21
Click here to add notes.
Date tag: January 21 2010 5:39:13
Sorting in scheme ancillary subordinate, or subsidiary.
Date tag: January 21 2010 5:28:34
There is a predefined library predicate called equal that should have the same semantics as my equal. U
Date tag: January 21 2010 5:28:28
Click here to add notes.
Date tag: January 21 2010 5:16:12
Click here to add notes.
Date tag: January 21 2010 5:15:34
Equivalence of sexprs
Date tag: January 21 2010 5:6:8
Click here to add notes.
Date tag: January 19 2010 6:18:39
Click here to add notes.
Date tag: January 19 2010 6:18:31
Click here to add notes.
Date tag: January 19 2010 6:14:1
Click here to add notes.
Date tag: January 19 2010 6:6:3
Click here to add notes.
Date tag: January 19 2010 6:3:42
Click here to add notes.
Date tag: January 19 2010 5:59:43
Click here to add notes.
Date tag: January 19 2010 5:53:44
Click here to add notes.
Date tag: January 19 2010 5:49:55
Click here to add notes.
Date tag: January 19 2010 5:45:5
Click here to add notes.
Date tag: January 19 2010 5:36:59
Click here to add notes.
Date tag: January 19 2010 5:36:47
Click here to add notes.
Date tag: January 19 2010 5:28:39
Click here to add notes.
Date tag: January 19 2010 5:28:31
Click here to add notes.
Date tag: January 19 2010 5:23:24
Click here to add notes.
Date tag: January 19 2010 5:23:17
Click here to add notes.
Date tag: January 19 2010 5:15:56
Click here to add notes.
Date tag: January 19 2010 5:15:45
Click here to add notes.
Date tag: January 19 2010 5:15:38
Click here to add notes.
0 1 2 3 4 5 6 7 8