Description: division through carefully selected elements v, one can be the worst time complexity of O (n) algorithm. The internship requirement c language used this algorithm. Calls for this function : the importation of a number of groups, the return of A [i], so A (m : p) k small elements, k is a global variables, from an integer greater than
File list (Check if you may need any files):