Algorithms Analysis and Design

• Dynamic Programming
• Greedy
• Backtrack

Data Structure

Structured

• Retional Database (Scheme): PostgreSQL, MySQL, Orical, DB2, SQL-Server, SQLite.
• Program (Code)
  • C - struct
  • C++ - Class

Semi-Structured

• NoSQL Database (Scheme): Key-Value DB (Redis), Memery-Cache (), Document DB (MogoDB, CaceDB)
• Web Information (Tag): XML(Atom, RSS), JSON, Protocal Buffer (Google)

Non-Strucutred - Files

• Binary, Text

Contest/Competiton

TopCoder

• Setting up TopCoder Arena
  • Make sure you have JDK in your computer (Install OpenJDK(Recommanded) first and Check JDK version java -version)
  • (Way 1) Java Client on Ubuntu Linux: Execute command wget http://www.topcoder.com/contest/arena/ContestAppletProd.jnlp and javaws ContestAppletProd.jnlp in your shell.
  • (Way 2) Java Applet: Execute command javaws http://www.topcoder.com/contest/arena/ContestAppletProd.jnlp
  • (Way 3) Run from www.topcoder.com/tc
  • Some TopCoder Plugins

Other's Precious

• Yin Wang's Data Structure Mindmap
• Binary Indexed Trees - Hawstein

1.Searching Algorithms

• Binary Search
  • The idea behind the Binary Search is that recursive divide the whole into two part each, and conquer it then.
  • Pre-condition to use binary search is that your sequence must be ordered.
  • My binarysearch: Time:O(logn)

2.Sorting Algorithms

• Sorting Algorithms - Wikipedia

• Quick Sort

  • The idea behind the Quick Sort algorihms is that reducing the full scaning time to log(n) times by using devide and conquer.
  • My quicksort: Time:O(nlogn)

3.Number

• Ugly Number
  • My ugly number source code: Time:O(n), SPace:O(n).
• Waiting lists
  • Prime Number
  • Prime Number - Pairs of Prime Numbers