Nazari, Azin2019-08-282019-08-282019-08-282019-08-16http://hdl.handle.net/10012/14970In this thesis, we study comparison based problems in a new comparison model called three-way, where a comparison can result in { >, =, < }. We consider a set of n balls with fixed ordered coloring. Particularly, we are interested in finding a ball of the majority color, the color that occurs more than half, when there are 2 colors, partition problem, where the goal is to determine groups of balls with the same color when there are 2 and 3 colors, respectively. We study these problems using both deterministic and randomized approaches.enalgorithmtheoretical computer sciencecomparison-based problemsmajoritypartitionMaster Thesis