@@ -9,7 +9,7 @@ log([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
9
9
10
10
// Linear runtime - Big O Notation: "O (n)"
11
11
function logAll ( array ) {
12
- for ( var i = 0 ; i < array . length ; i ++ ) {
12
+ for ( let i = 0 ; i < array . length ; i ++ ) {
13
13
console . log ( array [ i ] ) ;
14
14
}
15
15
}
@@ -20,8 +20,8 @@ logAll([1, 2, 3, 4, 5, 6, 7]);
20
20
21
21
// Exponential runtime - Big O Notation: "O (n^2)"
22
22
function addAndLog ( array ) {
23
- for ( var i = 0 ; i < array . length ; i ++ ) {
24
- for ( var j = 0 ; j < array . length ; j ++ ) {
23
+ for ( let i = 0 ; i < array . length ; i ++ ) {
24
+ for ( let j = 0 ; j < array . length ; j ++ ) {
25
25
console . log ( array [ i ] + array [ j ] ) ;
26
26
}
27
27
}
@@ -33,10 +33,10 @@ addAndLog(["A", "B", "C", "D", "E"]); // 25 pairs logged out
33
33
34
34
// Logarithmic runtime - Big O Notation: O (log n)
35
35
function binarySearch ( array , key ) {
36
- var low = 0 ;
37
- var high = array . length - 1 ;
38
- var mid ;
39
- var element ;
36
+ let low = 0 ;
37
+ let high = array . length - 1 ;
38
+ let mid ;
39
+ let element ;
40
40
41
41
while ( low <= high ) {
42
42
mid = Math . floor ( ( low + high ) / 2 , 10 ) ;
0 commit comments