cleanup sorting logic

Author: AhmedAbdoElhawary

lib/features/sorting/selection/view_model/selection_sort_notifier.dart

@@ -1,93 +1,42 @@
 import 'package:algorithm_visualizer/features/sorting/base/view_model/sorting_notifier.dart';
-import 'package:collection/collection.dart';
-import 'package:flutter/material.dart';
 
 class SelectionSortNotifier extends SortingNotifier {
   @override
-  Future<void> buildSort() async {
-    final list = List<SortableItem>.from(state.list);
-    final values = list.map((e) => e.value).toList();
-
-    final steps = selectionSortSteps(values);
-
-    for (final step in steps) {
-      if (operation != SortingEnum.played) return;
-
-      switch (step.action) {
-        case SortingStatus.compared:
-          list[step.index1] = list[step.index1].copyWith(sortedStatus: SortingStatus.compared);
-          list[step.index2] = list[step.index2].copyWith(sortedStatus: SortingStatus.compared);
-          state = state.copyWith(list: list);
-
-          await Future.delayed(speedDuration);
-
-          break;
-
-        case SortingStatus.swapped:
-          list[step.index1] = list[step.index1].copyWith(sortedStatus: SortingStatus.swapped);
-          list[step.index2] = list[step.index2].copyWith(sortedStatus: SortingStatus.swapped);
-          state = state.copyWith(list: list);
-
-          await Future.delayed(speedDuration);
-
-          list.swap(step.index1, step.index2);
-
-          final positions = Map<int, Offset>.from(state.positions);
-          final tempPosition = positions[list[step.index1].id]!;
-          positions[list[step.index1].id] = positions[list[step.index2].id]!;
-          positions[list[step.index2].id] = tempPosition;
-
-          state = state.copyWith(list: list, positions: positions);
-          break;
-
-        case SortingStatus.unSorted:
-          list[step.index1] = list[step.index1].copyWith(sortedStatus: SortingStatus.unSorted);
-          list[step.index2] = list[step.index2].copyWith(sortedStatus: SortingStatus.unSorted);
-          state = state.copyWith(list: list);
-          break;
-
-        // i don't want to make it green while sorting and mark all of them at once as green at the end
-        case SortingStatus.sorted:
-        case SortingStatus.none:
-          list[step.index1] = list[step.index1].copyWith(sortedStatus: SortingStatus.none);
-          state = state.copyWith(list: list);
-          break;
-      }
-
-      await Future.delayed(speedDuration);
-    }
-
-    await greenSortedItemsAsDone();
-  }
-
-  List<SortingStep> selectionSortSteps(List<int> values) {
+  List<SortingStep> buildSorting(List<int> values) {
     final steps = <SortingStep>[];
     final arr = List<int>.from(values);
 
     for (int i = 0; i < arr.length - 1; i++) {
       int minIndex = i;
 
       for (int j = i + 1; j < arr.length; j++) {
-        steps.add(SortingStep(index1: minIndex, index2: j, action: SortingStatus.compared)); // external
+        steps.add(SortingStep(index1: minIndex, index2: j, action: SortingStatus.compared));
 
         if (arr[j] < arr[minIndex]) {
-          // steps.add(SortingStep(index1: j, index2: j + 1, action: SortingStatus.swapped)); // external
+          final previousIndex = minIndex;
+          if (minIndex != i) {
+            steps.add(SortingStep(index1: previousIndex, index2: previousIndex, action: SortingStatus.none));
+          }
           minIndex = j;
         }
 
-        // steps.add(SortingStep(index1: j, index2: j + 1, action: SortingStatus.unSorted)); // external
+        steps.add(SortingStep(index1: minIndex, index2: j, action: SortingStatus.unSorted));
       }
 
-      steps.add(SortingStep(index1: i, index2: minIndex, action: SortingStatus.swapped)); // external
+      if (minIndex != i) {
+        steps.add(SortingStep(index1: i, index2: minIndex, action: SortingStatus.swapped));
 
-      final temp = arr[i];
-      arr[i] = arr[minIndex];
-      arr[minIndex] = temp;
+        final temp = arr[i];
+        arr[i] = arr[minIndex];
+        arr[minIndex] = temp;
+        steps.add(SortingStep(index1: minIndex, index2: j, action: SortingStatus.unSorted));
+      }
 
-      // steps.add(SortingStep(
-      //     index1: arr.length - i - 1, index2: arr.length - i - 1, action: SortingStatus.sorted)); // external
+      steps.add(SortingStep(index1: i, index2: i, action: SortingStatus.sorted));
     }
 
+    steps.add(SortingStep(index1: arr.length - 1, index2: arr.length - 1, action: SortingStatus.sorted));
+
     return steps;
   }
 }