Algorithms and Data Structures (WS15 16) Example Solutions for Unit 3 Problem 1 Algorithm: for the simplicity let’s assume that n = 2k, algorithm can be easily modified if n = 2k 1 by using one additional comparison - Adversary model - Document - PDFSEARCH.IO

First Page	Meta Content
	Algorithms and Data Structures (WS15/16) Example Solutions for Unit 3 Problem 1 Algorithm: for the simplicity let’s assume that n = 2k, algorithm can be easily modified if n = 2k + 1 by using one additional comparison Add to Reading List Document Date: 2016-03-02 15:13:55 Open Document File Size: 325,82 KB Share Result on Facebook

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 3 Problem 1 Algorithm: for the simplicity let’s assume that n = 2k, algorithm can be easily modified if n = 2k + 1 by using one additional comparison Add to Reading List