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
- Does the choice of compiler and language affect Time Complexity?
- How do I check if an array includes a value in JavaScript?
- Why is O(n) better than O( nlog(n) )?
- Difference between Big-O and Little-O Notation
- What would cause an algorithm to have O(log log n) complexity?
- Time complexity of Boost Graph function vertex() on adjacency_list
- Why when I use .size() to compute the length of array in the Conditional Determination of for Loop Structures will time out in leetcode?
- How can `HashSet<T>.Contains` be O(1) with this implementation?
- Space and time complexity of flattening a nested list of arbitrary depth
- Isn't every algorithm technically ω(0)?
- Time complexity of nested for-loop
- What is the time complexity of java.util.Collections.sort() method?
- The limits of parallelism (job-interview question)
- Java TreeMap time complexity - lowerKey
- What is space complexity for breadth-first search on a binary tree?
- 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?