You have given an array in which numbers are first increasing and then decreasing. Find the maximum element in O(log n).

An integer array with unique elements has the following property – elements initially are in increasing order till a point after which they start to decrease. Implement a function to find the index of the maximum element in the array in less than linear time, i.e., O(n).

Example:
Input: array = {1, 3, 5, 7, 9, 8, 6, 4} Output: max index = 4

Max Index : 4. Max Element value is : 9

Comments

Greedy algorithms for Job Scheduling

In this programming problem and the next you'll code up the greedy algorithms from lecture for minimizing the weighted sum of completion times.. This file describes a set of jobs with positive and integral weights and lengths. It has the format [number_of_jobs] [job_1_weight] [job_1_length] [job_2_weight] [job_2_length] ... For example, the third line of the file is "74 59", indicating that the second job has weight 74 and length 59. You should NOT assume that edge weights or lengths are distinct. Your task in this problem is to run the greedy algorithm that schedules jobs in decreasing order of the difference (weight - length). This algorithm is not always optimal. IMPORTANT: if two jobs have equal difference (weight - length), you should schedule the job with higher weight first. Beware: if you break ties in a different way, you are likely to get the wrong answer. You should report the sum of weighted completion times of the resulting schedule --- a posi

You are given four integers 'a', 'b', 'y' and 'x', where 'x' can only be either zero or one. Your task is as follows: If 'x' is zero assign value 'a' to the variable 'y', if 'x' is one assign value 'b' to the variable 'y'. You are not allowed to use any conditional operator (including ternary operator). Possible Solutions: 1. y = (1 - x) * a + x * b; 2.y = a ^ ((a ^ b) & (x))

Anomalies with Double check locking

Already we have a nice article about about problems with double check locking. we will see two nice quick workarounds and its pros and cons . Double-checked locking: Clever, but broken and Double-Checked Locking is Broken . before getting into solution, classic singleton uses the following signature for get instance: public static Resource getResource() { if (resource == null) resource = new Resource(); return resource; } so the above code will only create the new resource object if no instance of resource is found. This mechanism is called lazy loading more preciously need based loading we only load resources if and only if it is required. Benefit associated with this approach is performance improvement, if resource creation is a heavy process and we do not want it to be carried when class is loading t then this classic approach does make sense. public static synchronized Resource getResource() { if (resource == null) resource = n

QuickJava

Search This Blog