problem - minimize-the-maximum-difference-between-the-heights/ from gekks for geeks {i cannot send link its not allowed here sosearch the above name of problem you will find the question}
, link o f solution solution,https://ide.codingblocks.com/s/335453
please dry run this code by taking input k=10 and array =
{ 2 4 6 8 }
please send me a proper dry run of this code , with this example actually i mention the part of code which i am not able to understand , even i know what is happening there but still not able to solve this array, please solve this with the help of dry run , please send me a solved answer on pen paper, with a tricky example not easy one , i want a example in which my last if else condition come in role to update big and small, so please send me a dry run pick, DRY RUN PICK WITH A EXAMPLE WHICH INCLUDE THE LAST IF ELSE CONDITION WHICH I ALREADY MENTIONED IN MY SOLUTION,