×

# MRGSRT - EDITORIAL

 0 Difficulty:Medium Pre-requisites: Divide and conquer Problem link: Contest problem link Practice problem link Problem: To find the stack image when merge sort is called. Explanation: This problem can be solved in two ways: By simulating merge sort and printng the calls made. Using binary search: In this approach the given size is divided into 2 parts using mid=(L+R)/2; if(mid>=N) //N is the index to be found R=mid; //Shift the right pointer to middle i.e. index lies between middle and left else L=mid+1; //Shift the left pointer to middle+1 i.e. index lies between middle and right  Using the second one is more preferable. Problem setter's solution: SOLUTION asked 31 May '15, 01:01 1★preetam 6●2 accept rate: 0%

 0 I am unable to understand what is the problem statement. Can anyone elaborate the question(problem statement)? answered 15 Jan, 18:36 1 accept rate: 0%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×13,731
×120

question asked: 31 May '15, 01:01

question was seen: 911 times

last updated: 15 Jan, 18:36