Fix: avoid duplicate sort in initiallyFocusedKey computation

Replace the full array sort in the useState initializer with a linear
scan that finds the minimum selected item using the comparator directly.
This eliminates the duplicate sort while keeping initiallyFocusedKey
stable across re-renders (no search-clear scroll bug).

Co-authored-by: mkhutornyi <mkhutornyi@users.noreply.github.com>

Author: MelvinBot

src/components/Search/SearchMultipleSelectionPicker.tsx

@@ -36,8 +36,15 @@ function SearchMultipleSelectionPicker<T extends string | string[]>({
     const [initialSelectedIDs] = useState(() => new Set((initiallySelectedItems ?? []).map((item) => item.value.toString())));
     const [selectedItemIDs, setSelectedItemIDs] = useState(() => initialSelectedIDs);
     const [initiallyFocusedKey] = useState(() => {
-        const sorted = [...items].sort((a, b) => sortOptionsWithEmptyValue(a.value.toString(), b.value.toString(), localeCompare));
-        return sorted.find((item) => initialSelectedIDs.has(item.value.toString()))?.name;
+        let minItem: SearchMultipleSelectionPickerItem<T> | undefined;
+        for (const item of items) {
+            if (initialSelectedIDs.has(item.value.toString())) {
+                if (!minItem || sortOptionsWithEmptyValue(item.value.toString(), minItem.value.toString(), localeCompare) < 0) {
+                    minItem = item;
+                }
+            }
+        }
+        return minItem?.name;
     });
 
     const searchLower = debouncedSearchTerm.toLowerCase();