Computer Science · Data Structures
LB और UB एक लीनियर एरे (linear array) LA की निचली सीमा (lower bound) और ऊपरी सीमा (upper bound) हैं। निम्नलिखित एल्गोरिद्म पर विचार करें: 1. K = LB से UB के लिए दोहराएं: LA[K] पर PROCESS लागू करें 2. निकास (Exit) यह एल्गोरिद्म एरे LA को ______ करता है।
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1सॉर्ट (sort)
- 2ट्रैवर्स (traverse)✓
- 3मर्ज (merge)
- 4सर्च (search)
सही उत्तर देखें
ट्रैवर्स (traverse)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures