is it option a?

The Gateway to Computer Science Excellence

0 votes

0

Arrays are contiguously allocated data structures, and linkes lists are randomly allocated. So if you bring a page containing an array, the next few elements will also be present in the same page, but this is not the case with LL, so arrays follow LOR.

In linear search, we would be always accessing the next element, hence Linear search follows LOR. Wherreas in binary search next element is based on condition being true or false so it doesn't follow LOR

In linear search, we would be always accessing the next element, hence Linear search follows LOR. Wherreas in binary search next element is based on condition being true or false so it doesn't follow LOR

0

@Chaitrasj if elements is in contagious way,then binary search is best as we know that location will be exact of required element in that page

is n't??

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,373 answers

198,513 comments

105,289 users