JobsJob TrackerJob alerts

BARC ยท 18 questions

All 18Coding 9
  • Explain hashing in detail and write insertion codeCoding
  • Binary search functionality and variationsCoding
  • Detect cycle in a directed graphCoding
  • Pointer operations, matrices, and functionsCoding
  • Wi-Fi, Bluetooth, and TCP/IP architectures
  • DBMS recovery, cursors, and SQL duplicates
  • Linking, ML vs Deep Learning, Regression vs Interpolation
  • C Pointers and RecursionCoding
  • AVL Trees and Binary TreesCoding
  • TCP/IP and Networking Basics
  • Paging and Memory Management
  • OS Fundamentals
  • Data Structure ImplementationCoding
  • Implement QueueCoding
  • Second Largest elementCoding
  • IP Address basics
  • Process Communication and Synchronization
  • CFG and Pumping Lemma
โ† BARC questions
  1. Interview questions
  2. BARC
  3. Binary search functionality and variations
Coding

Binary search functionality and variations

Filed under BARC

The question

Explain how binary search works, compare it with hashing, state its time complexity, and analyze how comparisons change if the array is divided into 3/4ths instead of halves.

No write-up yet. Related questions below have one.

Related BARC questions

  • Explain hashing in detail and write insertion code
  • Pointer operations, matrices, and functions
  • C Pointers and Recursion
  • AVL Trees and Binary Trees
  • Data Structure Implementation
โ† Explain hashing in detail and write insertion codeDetect cycle in a directed graph โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.