About

This section of the website is designed for two reasons:

The ACM sponsors an international programming contest for college students, known as the International Collegiate Programming Contest (ICPC). Teams of three students write computer programs to solve a set of problems in five hours. Programming teams from the states of MS, AL, GA, SC, and FL compete at the Southeast Region (SER) Contest; the best team from that contest represents the region at the world finals.

I personally use Java on TopCoder, so all tutorials are in Java

It is our goal to place a team in the Top 3 next year, and of course beat Georgia Tech.

Current Tutorial

08/19/2006 - String Manipulation #4 - String Searching
This tutorial will teach you some Java functions to use for doing string searches.

Past Tutorials

03/04/2006 - String Manipulation #1 - Conversions
03/17/2006 - String Manipulation #2 - Splitting and Concatenating
03/19/2006 - Data Structures #1 - Arrays vs. Vectors
08/11/2006 - String Manipulation #3 - Comparison

Future Tutorials

String Manipulation #5 (pattern / regex)
Math #1 (max/min, pow, binomial theorem, probability)
Math #2 (fractions, complex numbers, gcd/lcm, abs, ceil/floor)
Sorting #1 (bubble, insertion, merge)
Data Structures #2 (stack, queue, singly and doubly linked lists)
Data Structures #3 (binary search trees, priority queues)
Sorting #2 (binary, heap, quick, radix)
Data Structures #4 (hashmaps)
Math #3 (primes, the sieve)
Math #4 (decimal format, base conversion)
Algorithms #1 (dfs, bfs)
Algorithms #2 (prim, kruskal)
Algorithms #3 (greedy, fractional knapsack problem)
Algorithms #4 (dynamic programming)
Math #5 (vectors [add, dot, cross], line-point distance)
Math #6 (line intersection, circle from 3 points)
Math #7 (reflection, rotation, polygon area, area)
Algorithms #5 (ford-fulkerson, dijkstra, floyd-warshall)

plants