%0 Book Section %1 haddar11_7 %A Al-Haj Baddar, Sherenaz W. %A Batcher, Kenneth E. %B Designing Sorting Networks %D 2011 %I Springer New York %K algorithm baddar.batcher sorting sorting.network textbook %P 43-47 %R 10.1007/978-1-4614-1851-1_7 %T Divide and Conquer %X Many algorithms use the divide-and-conquer strategy. Thus, it makes sense to try to use it to construct new sorting networks. We call keys that are out of their locations “strangers”. A strategy that can be used to design faster sorting networks using the divide-and-conquer technique is proposed here. Firstly, connect the %& 7 %@ 978-1-4614-1850-4

@inbook{haddar11_7, abstract = {Many algorithms use the divide-and-conquer strategy. Thus, it makes sense to try to use it to construct new sorting networks. We call keys that are out of their locations “strangers”. A strategy that can be used to design faster sorting networks using the divide-and-conquer technique is proposed here. Firstly, connect the }, added-at = {2014-04-20T00:52:14.000+0200}, author = {Al-Haj Baddar, Sherenaz W. and Batcher, Kenneth E.}, biburl = {https://www.bibsonomy.org/bibtex/219c63e3784c7e2da397fefb6307e6ed8/ytyoun}, booktitle = {Designing Sorting Networks}, chapter = 7, doi = {10.1007/978-1-4614-1851-1_7}, interhash = {ae1772a88d64de041ca9000eb9ad2cce}, intrahash = {19c63e3784c7e2da397fefb6307e6ed8}, isbn = {978-1-4614-1850-4}, keywords = {algorithm baddar.batcher sorting sorting.network textbook}, language = {English}, pages = {43-47}, publisher = {Springer New York}, timestamp = {2016-10-27T12:46:44.000+0200}, title = {Divide and Conquer}, year = 2011 }