Computer Engineering Student
Project Euler: 'Maximum Path Sum' (problems 18 and 67)
Brute force is no match for a nifty algorithm!
Project Euler: 'Power Digit Sum' (problem 16)
Q: How do you find the sum of the digits of a number that's too large for any native data type?A: Create a big array of integers!
Adding Disqus to your blog is ridiculously easy!
It took me roughly 2 minutes.
Algorithms: BubbleSpan Sort (by Dan Stover)
Kicks the sht out of BubbleSort!
"Introduction to Algorithms"
So it begins...
stevehenningsgard.com © 2015. All rights out the window.
Old site w/ more info