One of the most common tasks you will find in geometry problems is line intersection. Say we are given two different points, (x1, y1) and (x2, y2) for both the lines.How will you find the point of intersection of two lines.
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.
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.
Comments
Post a Comment