Talk:Selection (evolutionary algorithm)
Appearance
What is gained by sorting the population by the value of the fitness function? Molinari 01:07, 29 July 2005 (UTC)
After sorting, binary search can be used, leading to a time complexity of O(n log n) for the whole selection process, whereas if you don´t you will have to search through all elemetns for each selection, leading to a time complexity of O(n^2). AB