Answer / Mohit Pal

Binary Search has a logarithmic time complexity (O(log n)), which means its efficiency increases as the size of the data set grows. However, it has two scenarios with different complexities:

1. Best Case Complexity (O(log n)): The best case occurs when the target element is in the middle or one of the extreme ends of the sorted array. In this case, the search operation requires a minimum number of comparisons.
2. Worst Case Complexity (O(log n)): The worst case occurs when the target element is not present in the array and the search proceeds until it reaches an empty sub-array. In the worst case, binary search still performs better than linear search.

When are the SBI clerk 2010 results are expected???

1 Answers  

---

What is the fallacy in the following program segment ? int *f1() { int a=5; return &a; } f() int *b=f1() int c=*b; }

1 Answers   Geometric Software,

---

the conditional jump instruction in 8086 have a displacement of more than 1 byte.explain how would you tackle a situation in which it is required to branch,on some condition,to a location which is more than 120 bytes away.

1 Answers  

---

Please derive the formula for the area of a circle.

1 Answers  

---

what is recursion in c language?

1 Answers  

---

MILITARY ENGINEER SERVICES

1 Answers   ASD Lab, MES,

---

is the used fire extinguisher fall under Hazardous waste material?

1 Answers  

---

Please mail me the sample papers of PNB for the post Dy. Manager.

1 Answers  

---

How can I get know that my pc contains dram or sram..?

1 Answers  

---

#include<stdio.h> int main() { char *ptr; char string[] = "How are you?"; ptr = string; ptr += 4; printf("%s",ptr); return 0; }

5 Answers   Wipro, Zoho,

---

searching a B-tree indexed tree compared to B+ tree is slow..True or false

1 Answers   NIC,

---

how to use photoshop and some related websites?

1 Answers  

---