diff --git a/src/runtime/src/coreclr/jit/jitstd/algorithm.h b/src/runtime/src/coreclr/jit/jitstd/algorithm.h
index f75868812c8..008da9a7015 100644
--- a/src/runtime/src/coreclr/jit/jitstd/algorithm.h
+++ b/src/runtime/src/coreclr/jit/jitstd/algorithm.h
@@ -14,6 +14,7 @@ namespace
 // Sort the elements in range [first, last] using insertion sort, an efficient alternative
 // to quick sort when the range to be sorted is small enough.
 template <typename RandomAccessIterator, typename Less>
+[[maybe_unused]]
 void insertion_sort(RandomAccessIterator first, RandomAccessIterator last, Less less)
 {
     for (RandomAccessIterator i = first; i < last; ++i)
@@ -32,6 +33,7 @@ void insertion_sort(RandomAccessIterator first, RandomAccessIterator last, Less
 
 // Sort the elements in range [first, last] using quick sort.
 template <typename RandomAccessIterator, typename Less>
+[[maybe_unused]]
 void quick_sort(RandomAccessIterator first, RandomAccessIterator last, Less less)
 {
     // Avoid real recursion as it can be slower, at least due to the extra "less"