Algorithm for factoring a 30 decimal digit number
Which algorithms give the best performance for 30 decimal digit numbers? 


30 decimal digits is 100 binary digits. 


Trial division will require around $2^{50}$ divisions.
Pollard-Rho-Factoring will require around $2^{25}$ checks - this may be a good pick for you if you want to implement it yourself quickly and don't mind having to wait a bit on an optimized execution result.
Most decent quadratic sieve implementations will do this number within seconds.
Most ECM implementations will do that too. If you need something more optimized than Pollard-Rho, using ECM is probably a good pick. Refer to this database for optimal curve representation choices and the Handbook of Applied Cryptography (Ch14, PDF) for fast scalar multiplication strategies.