In this paper, we present the exact method foran integer-wise comparison technique in FHE domain usingpolynomial interpolaion and analyze the performance againstbit-wise comparison techniques. We observe that even thoughthe integer-wise comparison requires only one ciphertext unit forinteger in contrast to l ciphertext units for an l-bit integer forbit-wise comparison, bit-wise comparison schemes have betterperformance due to less multiplicative depth of the comparisoncircuit. Our analysis shows that bit-wise comparison based ondepth optimized circuits have O(log(l)) multiplicative depth, where as the integer-wise comparison has O(l) multiplicativedepth and bit-wise comparison based on two's complementarithmetic techniques has O(l) multiplicative depth. We haveevaluated the performance of odd-even merge sort and direct sortby considering all the three above stated comparison techniqueson FHE data using HElib library and analyzed their complexities.