| Chapter 5 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
25 |
|
Delete Content |
| Chapter 5 - Computer Science |
text |
leftmost element, and that element becomes a N otes part ... |
26 |
|
Delete Content |
| Chapter 5 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
27 |
|
Delete Content |
| Chapter 5 - Computer Science |
text |
N otes 5. All the branches of XYZ school conducted an apt... |
28 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
1 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
a p t e r C h 6 Searching “Eventhoughmostpeoplewon'tbedir... |
2 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
3 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
6.2 L inear S earch Linear search is the most fundamental... |
4 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
5 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
Table 6.2 Linear search for key 17 in numList of Table 6.... |
6 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
7 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
Let us now assume another case, where the key being searc... |
8 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
9 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
N otes 6.3 B inary Search Consider a scenario where we ha... |
10 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
11 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
If the middle element is greater than the key it means th... |
12 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
13 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
Algorithm 6.2: Binary Search BinarySearch(numList, key) S... |
14 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
15 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
is the minimum amount of work binary search would have to... |
16 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
17 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
6.3.1 Applications of Binary Search • Binary search has n... |
20 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
21 |
|
Delete Content |
| Chapter 6 - Computer Science |
text |
method explained earlier to create a hash table as shown ... |
22 |
|
Delete Content |
| Chapter 6 - Computer Science |
image |
/default_org/ncert_images/class-xii/c... |
23 |
|
Delete Content |