For small values of n any algorithm is fast enough Running time-05680

For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.

This multiple choice question (MCQ) is related to the book/course vu cs502 Fundamentals of Algorithms. It can also be found in vu cs502 Mid Term - Quiz No.1.