Can't have the value of P for this recurrence using Akra Bazzi method
Using Akra Bazzi method for this recurrence,
Here, 
Now, I can't get the value of P. How can I solve this recurrence?
Solution
in this case we know that the value of P would be less than 1. That means value of P would be less than the order of g(x). Hence we can say that the complexity would be θ(g(x)) i.e. θ(n).
Refer this https://youtu.be/Kqf0uO0oV6s?t=4571
- The limits of parallelism (job-interview question)
- I’d like to understand why this code runs so slowly
- Run Time Anaysis of Nested Loop
- Space Complexity of Storing a Binary Representation of an Integer
- Will Arrays.sort() increase time complexity and space time complexity?
- What is the right way to solve Codility's PermMissingElem test in Java?
- Why does the Perm-Missing-Elem Codility test return a 66/100 result for my code, and show me "Invalid result type, int expected"?
- How many number are less than or equal than x in an array?
- find 4th smallest element in linear time
- finding the second minimum
- Find shortest subarrays A[0:L], B[0:L] where M different elements in A are bigger than M different elements in B (time complexity)
- How can I enhance the time complexity of arranging bricks into stacks based on specific conditions?
- List-like data-structure with O(1) access in practice but O(N) access for huge sizes; What is it?
- If the BinPack problem were in P, how to get a packing that minimizes the number of bins in P?
- Explain time complexity of permutations using the mathematical expression
- Are there any tools that can determine perform code analysis for Big-O complexity?
- What's the time complexity of JavaScript spread syntax in arrays?
- How do I identify O(nlogn) exactly?
- What is the Time Complexity and Space Complexity of extending a string according to a rule?
- How do I optimize this XOR sum algorithm?
- Find minimum cost to buy products
- Floyd–Rivest vs. Introselect algorithm performance
- Find the number of valid substrings
- Time Complexity of Backtracking solution - Leetcode 473. Matchsticks to Square
- Can we get a better complexity than O(n) for cumulative sum while using multithreading?
- What is a plain English explanation of "Big O" notation?
- What's the time complexity of array.splice() in Google Chrome?
- Is lseek() O(1) complexity?
- O(n log n) algorithm to find number of large inversions
- How to analyze time complexity of an algorithm with different running time