Skip to content

Instantly share code, notes, and snippets.

View sponnusa's full-sized avatar
👻
Vicious Electron Journey!

Suri sponnusa

👻
Vicious Electron Journey!
View GitHub Profile
@sponnusa
sponnusa / _service.md
Created September 10, 2016 11:42 — forked from naholyr/_service.md
Sample /etc/init.d script

Sample service script for debianoids

Look at LSB init scripts for more information.

Usage

Copy to /etc/init.d:

# replace "$YOUR_SERVICE_NAME" with your service's name (whenever it's not enough obvious)
@sponnusa
sponnusa / why.markdown
Created August 22, 2016 12:53 — forked from egonSchiele/why.markdown
Why read Grokking Algorithms?

If you have already taken a course in algorithms, why read Grokking Algorithms (manning.com/bhargava)?

If you were learning graph algorithms, which approach would you prefer:

  1. Imagine you have to take public transit from your home to your office. How do you figure out the fastest route? Use graph algorithms! OR

  2. We can choose between two standard ways to represent a graph G = (V, E): as a collection of adjacency lists or as an adjacency matrix. Either way applies to both directed and undirected graphs.

I prefer the first way: lead with lots of examples, and clear writing. The second way is an excerpt from "Introduction to Algorithms"...that's how they start their section on graph algorithms.