Question regarding the mid value used in the most searching and sorting algorithms.
" The safest way to find the middle of two numbers without getting an overflow is as follows: mid = start + (end-start)/2 " Why it can't be mid = (start + end) / 2 ?
4/10/2021 5:07:50 PMPrince Gupta
16 AnswersNew Answer
start + (end - start) / 2 Is preferred because there is a possibility in a very large array that the result from (start + end) could cause an integer overflow where the resulting value is larger than the max value for int. This would end up in a negative value, causing the index to be out of the bounds of the array.
Use binary sort 😎
it is same, m = (l+r)/2 you should know what it does, In array it takes the array indices and then it find the mid value on its basis we access the mid position's value. let l = start, r = end, m = mid; m = l + (r-l)/2 = l + r/2 - l/2 = l/2+r/2 = (l+r)/2. That's how the fancy formula is straight forward written.
May anyone provide me with an example ?
good...to know this thing!!
thnx for the help wil try apllying it
Your article content is being very much interested, I am very impressed with your post. I hope to receive more great posts. https://www.mygroundbiz.me/
Thanks for sharing this is useful information. https://www.skylightpaycard.me/
One measure of efficiency is the time used by a computer to solve a problem using the algorithm, when input values are of a specified size. https://www.dgcustomerfirst.page/
One measure of efficiency is the time used by a computer to solve a problem using the algorithm, when input values are of a specified size https://www.navyarmyccu.ltd/
Thanks for sharing, I found a lot of interesting information here. A really good post, very thankful and helpful. https://www.mycardstatement.pro/