aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Algorithm Time Complexity Analysis
  • Directions: Find the time complexities of the following q...
Multiple choice

Directions: Find the time complexities of the following question.

T(n)=T(n-2)+2logn

  1. O(n2)

  2. O(nlog3)

  3. O(n)

  4. O(log n)

Reveal answer Fill a bubble to check yourself
B Correct answer

Keep practicing — related questions

  • find the error in following code(GIVE THE LINE NO) 1 IF A > B 2 MOVE 1 TO FLAG-A 3 MOVE 200 TO VALUE-B. 4 I...
  • You should add the static keyword in the place of ? in Line ________ in the following code: 1 public class ...
  • What will be the result of executing the following code? 1. boolean a = true; 2. boolean b = false; 3. bool...
  • Given: 3. class A { } 4. class B extends A { } 5. public class ComingThru { 6. static String s = "-"; 7. pu...
  • Pipe A can fill in 20 minutes and Pipe B in 30 mins and Pipe C can empty the same in 40 mins.If all of them...
  • Consider the following piece of code: 1 long i = 2 ; 2 switch (i) { 3 case 1: 4 System.out.println ("Case 1...
  • Given the following code, which is true: IF A > B THEN C = A – B ELSE C = A + B ENDIF Read D IF C = D Then ...
  • 10. I am the smallest positive integer that has the following properties. When I am divided by 2, the remai...
Play the full quiz 🎤 Practise this topic out loud

Practice this topic

  • Data Structures and Algorithms (1518 questions)
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy