Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.
You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.
potential bug in first statement...
ReplyDeleteif ( x == 0 ) // if we forget and make it single =, it becomes x = 0, and the bug is severe that cant be found so easily unless we have eagle eyes :)
so second statement is better.
@B Ramesh yeah very true and if we make it single = in second statement it will give error.(invalid lvalue in assisgment).
ReplyDelete