fix(learn): Removed note about commented array from sorting algorithm challenges (#40652)

curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-bubble-sort.md

@@ -16,9 +16,6 @@ This method requires multiple iterations through the array and for average and w
 
 **Instructions:** Write a function `bubbleSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
 
-**Note:**  
-We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging `array` to see your sorting algorithm in action!
-
 # --hints--
 
 `bubbleSort` should be a function.

curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-insertion-sort.md

@@ -12,9 +12,6 @@ The next sorting method we'll look at is insertion sort. This method works by bu
 
 **Instructions:** Write a function `insertionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
 
-**Note:**  
-We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging `array` to see your sorting algorithm in action!
-
 # --hints--
 
 `insertionSort` should be a function.

curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-merge-sort.md

@@ -20,9 +20,6 @@ As an aside, this will be the last sorting algorithm we cover here. However, lat
 
 **Instructions:** Write a function `mergeSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest. A good way to implement this is to write one function, for instance `merge`, which is responsible for merging two sorted arrays, and another function, for instance `mergeSort`, which is responsible for the recursion that produces single-item arrays to feed into merge. Good luck!
 
-**Note:**  
-We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging `array` to see your sorting algorithm in action!
-
 # --hints--
 
 `mergeSort` should be a function.

curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-selection-sort.md

@@ -12,9 +12,6 @@ Here we will implement selection sort. Selection sort works by selecting the min
 
 **Instructions**: Write a function `selectionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
 
-**Note:**  
-We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging `array` to see your sorting algorithm in action!
-
 # --hints--
 
 `selectionSort` should be a function.