- Given:
- A list of numbers
- Two different sorting algorithms
- Use cost i.e. different cost value for a move vs. comparison
- Determine which algorithm is the most efficient
- Heap sort
- Determining average number of reads in a BST
- Multiply the number of nodes by the level number
- Divide by the number of nodes
- Deleting nodes from a BST:
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import ( | |
"fmt" | |
"bytes" | |
"strconv" | |
) | |
type operand interface { | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<div class="report-table mobile-clear"> | |
<div class="report-row unit-row"> | |
<div class="report-cell one-fifty"> | |
<div class="report-row-label"> | |
<label> </label> | |
</div> | |
</div> | |
<div class="report-cell one-twenty"> | |
<div class="report-row-label"> | |
<label>Lvls:</label> |
This turned out a bit longer than I expected, so here's the conclusion
Although there was a bit of ramp up time, I found this portion of the project to be a great primer on creating, connecting to and transmitting with sockets.
As far as resources go, I may very well be in the minority in that I didn't find things like Beej's Guide to Network Programming or the Linux Programming Interface to be particularly helpful as a first resource for this exercise. As thorough as they are, they were almost too indepth and I wound up inadvertently complicating things by attempting to apply the patterns in it.
The best resources for me were:
OlderNewer