@@ -462,7 +462,7 @@ String html = """
462462** Formula:** If result is negative: ` insertion point = -result - 1 `
463463
464464``` java
465- int [] sorted = {10 , 20 , 30 , 40 , 50 };
465+ int [] sorted = {% raw % }{ 10 , 20 , 30 , 40 , 50 }{ % endraw % };
466466int result = Arrays . binarySearch(sorted, 25 ); // Returns -3
467467int insertionPoint = - result - 1 ; // -(-3) - 1 = 2
468468// 25 would be inserted at index 2 (between 20 and 30)
@@ -497,8 +497,8 @@ System.out.println(c.equals(d)); // true (value comparison)
497497- ** Arrays.deepEquals()** : Deep comparison - recursively compares multi-dimensional arrays
498498
499499``` java
500- int [][] array1 = {{ 1 , 2 }, {3 , 4 }};
501- int [][] array2 = {{ 1 , 2 }, {3 , 4 }};
500+ int [][] array1 = {% raw % }{{ 1 , 2 }, {3 , 4 }}{ % endraw % };
501+ int [][] array2 = {% raw % }{{ 1 , 2 }, {3 , 4 }}{ % endraw % };
502502
503503Arrays . equals(array1, array2); // false (compares references of sub-arrays)
504504Arrays . deepEquals(array1, array2); // true (compares content recursively)
0 commit comments