Add a TODO comment ... insertion sort in a loop is awkward

Author: andreilitvin

src/app/clusters/network-commissioning/network-commissioning.cpp

@@ -267,6 +267,9 @@ CHIP_ERROR ThreadScanResponseToTLV::LoadResponses(Platform::ScopedMemoryBuffer<T
             scanResponseArrayLength++;
         }
         scanResponseArray[scanResponseArrayLength - 1] = scanResponse;
+
+        // TODO: this is a sort (insertion sort even, so O(n^2)) in a O(n) loop,
+        ///      maybe we should find something better than a O(n^3) to preserve the highest rssi only
         Sorting::InsertionSort(scanResponseArray.Get(), scanResponseArrayLength,
                                [](const ThreadScanResponse & a, const ThreadScanResponse & b) -> bool { return a.rssi > b.rssi; });
     }