@@ -31,7 +31,7 @@ public <T extends Comparable<T>> int findIndex(T[] array, T key) {
3131int fibN2 =0 ;// (n-2)th Fibonacci term
3232int fibN =fibN1 +fibN2 ;// nth Fibonacci term
3333
34- //fibN should store the smallest Fibonacci Number greater than or equal to size
34+ //
3535while (fibN <size ) {
3636fibN2 =fibN1 ;
3737fibN1 =fibN ;
@@ -45,20 +45,20 @@ public <T extends Comparable<T>> int findIndex(T[] array, T key) {
4545// Check if fibN2 is a valid location
4646int i =min (offset +fibN2 ,size -1 );
4747
48- //If key is greater than the value at index fibN2, cuts the sub-array from offset to i
48+ //
4949if (array [i ].compareTo (key ) <0 ) {
5050fibN =fibN1 ;
5151fibN1 =fibN2 ;
5252fibN2 =fibN -fibN1 ;
5353offset =i ;
5454 }
5555
56- //If x is greater than the value at index fibN2, cuts the sub-array after i+1
56+ //
5757else if (array [i ].compareTo (key ) >0 ) {
5858fibN =fibN2 ;
5959fibN1 =fibN1 -fibN2 ;
6060fibN2 =fibN -fibN1 ;
61- }else return i ;//Element found
61+ }else return i ;//
6262 }
6363// comparing the last element with key
6464if (fibN1 ==1 &&array [offset +1 ].compareTo (key ) ==0 )