Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1332-2058-4 |
Объём: | 140 страниц |
Масса: | 233 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was devised by Ken Batcher. The resulting sorting networks consist of O(n log2(n)) comparators and have a delay of O(log2(n)), where n is the number items to be sorted.A sorted sequence is a monotonically non-decreasing (or non-increasing) sequence.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.