We survey on numerics for finite-dimensional nonlinear optimal control. The chapter is written as a guide to practitioners who wish to get rapidly acquainted with the main numerical methods used to efficiently solve an optimal control problem. We consider throughout two classical examples, quite simple but representative enough to be complexified and generalized to other problems: the Zermelo and the Goddard problems. We provide their solving codes that are available on the web and make the point on the most up-to-date and efficient methods existing nowadays. We range on direct and indirect methods, on Hamilton-Jacobi approaches and we end with optimistic planning. Our examples illustrate the pros and cons of the methods and we also show how those various approaches can be combined in view of augmenting the efficiency of the numerical solving.