Computer Science · Algorithms
O(n) समय जटिलता के साथ किसी एरे (array) में तत्वों के क्रम को इन-प्लेस (in-place) उलटने के लिए निम्नलिखित में से किस एल्गोरिथ्म का उपयोग किया जा सकता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1इंसर्शन सॉर्ट (Insertion sort)
- 2बाइनरी सर्च (Binary search)
- 3बबल सॉर्ट (Bubble sort)
- 4टू-पॉइंटर तकनीक (Two-pointer technique)✓
सही उत्तर देखें
टू-पॉइंटर तकनीक (Two-pointer technique)
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
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms