reformat the code

Author: AhmedAbdoElhawary

lib/features/sorting/heap/view_model/heap_sort_notifier.dart

@@ -40,12 +40,10 @@ class HeapSortNotifier extends SortingNotifier {
     void heapSort() {
       int n = arr.length;
 
-      // Build max heap
       for (int i = (n ~/ 2) - 1; i >= 0; i--) {
         heapify(n, i);
       }
 
-      // Extract elements one by one
       for (int i = n - 1; i > 0; i--) {
         steps.add(SortingStep(index1: 0, index2: i, action: SortingStatus.swapping));
         arr.swap(0, i);
@@ -56,7 +54,6 @@ class HeapSortNotifier extends SortingNotifier {
     }
 
     if (arr.isNotEmpty) heapSort();
-    // Mark the first element sorted
     steps.add(SortingStep(index1: 0, index2: 0, action: SortingStatus.sorted));
 
     return SortingResult(sortedValues: arr, steps: steps);

lib/features/sorting/merge/view_model/merge_sort_notifier.dart

@@ -12,14 +12,12 @@ class MergeSortNotifier extends SortingNotifier {
       int j = mid + 1;
 
       while (i <= mid && j <= right) {
-        // Compare current elements
         steps.add(SortingStep(index1: i, index2: j, action: SortingStatus.compared));
         steps.add(SortingStep(index1: i, index2: j, action: SortingStatus.unSorted));
 
         if (arr[i] <= arr[j]) {
           i++;
         } else {
-          // Bubble arr[j] left until it reaches position i
           int k = j;
           while (k > i) {
             steps.add(SortingStep(index1: k, index2: k - 1, action: SortingStatus.swapping));