Jump to content

Talk:Selection (evolutionary algorithm)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 192.35.241.134 (talk) at 12:22, 6 September 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

What is gained by sorting the population by the value of the fitness function? Molinari 01:07, 29 July 2005 (UTC)[reply]

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