A) The function must be completed with time complexity O(log(N)).
Find a local peak from an input unsorted array, a local peak is defined as any element i that is greater than element i+1 and i-1 (neighbouring elements in the list).
The first and last element only have to be greater than their single neighbouring element to be a local peak.
Return as output an integer representing the index of the element in the array that is a local peak, if multiple peaks exist, return the first found peak (ie. only return one peak)
For example; Calling local_peak([0,2,4,6,5,2]) returns 3.
B) The function must have a complexity of O(log(N)).
You cannot use the inbuilt function Pow or the operator ** for this question.
Write a function power(n, p) that takes a number and a power and returns the number raised to that power
For example; Calling power(2,8) returns 256.
Hi, there. (✿◠‿◠) Perfect Quality & Fast-Delivery are Promised! As you can see in my profile, I have done a lot of Python projects like this. As I majored algorithms & math, I can complete your project in 1 day. I alwa Plus
5 freelance font une offre moyenne de $23 pour ce travail
Hello, I went through your requirement specification and I can help you design both functions in Python in O(log(N)) complexity of time space. Please feel free to contact me to discuss further. Regards, Sunny
Hi ⭐ I am very confidence, I can finish in a 1hr. I have read your requirement very carefully. So I am really confidence your project. Python is my highest skill so I have rich experiences with python GUI and Game and Plus
Thank you for giving me a chance to bid on your project. i am a serious bidder here and i have already worked on a similar project before and can deliver as u have mentioned I have checked your requirements. We have Plus
Hi, I have 10 years of working experience in python development and can easily handle your project please inbox me so we can discuss further looking forward to work with you.