You are given N jobs with their start and end time mentioned.These jobs may have their timings overlapped.You have to suggest an algorithm such that maximum number of jobs can be performed in that given time interval.
Arrange the activities in increasing order of their finish times. Select the first activity. If any activity's starting time is greater than the finish time of last selected activity, select that activity...otherwise discard it and so on..
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.
Arrange the activities in increasing order of their finish times. Select the first activity. If any activity's starting time is greater than the finish time of last selected activity, select that activity...otherwise discard it and so on..
ReplyDelete@Anonymous yes your approach is correct.can you please post a code for others..:)
ReplyDelete