Commitf665f9e

committed

make binary_search easier to understand

1 parent9d6a326 commitf665f9eCopy full SHA for f665f9e

File tree

-4

lines changed

-4

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,17 +1,17 @@`
`1`		`-functionBinarySearch(array,element){// array = sorted array, element = element to be found,`
`2`		`-`
	`1`	`+functionBinarySearch(array,element){// array = sorted array, element = element to be found`
`3`	`2`	`varminIndex=0;`
`4`	`3`	`varmaxIndex=array.length-1;`
`5`		`-varcurrentIndex;`
`6`	`4`	`vartestElement;`
`7`	`5`
`8`	`6`	`while(minIndex<=maxIndex){`
`9`	`7`
`10`		`-middleIndex=Math.floor((minIndex+maxIndex)/2);`
	`8`	`+varmiddleIndex=Math.floor((minIndex+maxIndex)/2);`
`11`	`9`	`testElement=array[middleIndex];`
`12`	`10`
`13`	`11`	`tracer._print('Searching at index: '+middleIndex);`
	`12`	`+tracer._selectSet([minIndex,maxIndex]);`
`14`	`13`	`tracer._notify(middleIndex);`
	`14`	`+tracer._deselectSet([minIndex,maxIndex]);`
`15`	`15`
`16`	`16`	`if(testElement<element){`
`17`	`17`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,9 @@ function BinarySearch(array, element, minIndex, maxIndex) { // array = sorted ar`
`8`	`8`	`vartestElement=array[middleIndex];`
`9`	`9`
`10`	`10`	`tracer._print('Searching at index: '+middleIndex);`
	`11`	`+tracer._selectSet([minIndex,maxIndex]);`
`11`	`12`	`tracer._notify(middleIndex);`
	`13`	`+tracer._deselectSet([minIndex,maxIndex]);`
`12`	`14`
`13`	`15`	`if(testElement<element){`
`14`	`16`	`tracer._print('Going right.');`

Comments

(0)