Skip to content

Instantly share code, notes, and snippets.

View rain1024's full-sized avatar
🏠
Working from home

Vu Anh rain1024

🏠
Working from home
View GitHub Profile
@rain1024
rain1024 / restart.md
Created August 22, 2014 16:59
Windows
shutdown -r
@rain1024
rain1024 / 002. io.md
Last active October 1, 2022 05:58
shell

Input, Output

read X
read Y
echo $((X+Y))
echo $((X-Y))
echo $((X*Y))
echo $((X/Y))
  • Resources
  • Workflow
  • CRUD

Character

char          	Exactly one byte in size. At least 8 bits.
char16_t	Not smaller than char. At least 16 bits.
char32_t	Not smaller than char16_t. At least 32 bits.
wchar_t	        Can represent the largest supported character set.

Integer types (signed)

signed char	Same size as char. At least 8 bits.
@rain1024
rain1024 / nodejs.md
Last active August 29, 2015 14:06
nodejs

q, asyn, npm

Make it work

Do it right

image
Documentation
image
Testing
image
Package Management
image
Scaffolding
? mocha NPM ?

Package Management

@rain1024
rain1024 / graph.md
Last active October 4, 2015 00:25
algorithm

Graph Search Algorithm

Shortest Path Problem [1]

image

Algorithms

  • Dijkstra's algorithm solves the single-source shortest path problem.
  • Bellman–Ford algorithm solves the single-source problem if edge weights may be negative.
  • A* search algorithm solves for single pair shortest path using heuristics to try to speed up the search.
  • Floyd–Warshall algorithm solves all pairs shortest paths.
@rain1024
rain1024 / cheatsheet.md
Created November 18, 2014 08:43
SBT Cheatsheet

Run scala in sbt

sbt console