il blog di Biagio Raucci
SELECTION SORT is a comparison sorting algorithm that is used to sort a random list of items in ascending order. The comparison does not require a lot of extra space. It only requires one extra memory space for the temporal variable. By default, the sorted list is empty, and the unsorted list contains all the elements.…
Continua a leggere →The problem is the following, and is a modified version of the 2009 British Mathematical Olympiad issue: Find all nonnegative integers a and b such that Before looking at one possible way of solving this problem, which requires nothing more than school-level arithmetic, I want to explain why I like this problem, and problems of…
Continua a leggere →