sorted-ifyer 0.5.0

/*
Copyright 2025 𝕍𝕖𝕝𝕠𝕔𝕚𝕗𝕪𝕖𝕣

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License. */
   
/// Returns true if potentialy_sorted_stuff is sorted
/// bahavour with NaN or negative 0 or infinity is not defined
/// Maximum is the highest number to sort, usefull in bubblesort
/// Maximum must not be higher than potentialy_sorted_stuff.len()
/// Recursiveness is how inefficent it is with 0 being the most efficent.
/// Inefficency increases ((recursiveness)*2) once recursiveness >=1 asumming all other variables are the same
pub fn is_sorted<T: std::cmp::PartialOrd>(
    potentialy_sorted_stuff: &[T], maximum: usize, recursiveness: u128,
    version: u128
) -> bool {
    assert!(
        version == 0 || version == 254 || version == 255,
        "883842 version not supported, version == {version}"
    );
    assert_eq!(recursiveness, 0, "74118115 recursiveness is currently not supported");
    for i in 1..maximum {
        if potentialy_sorted_stuff[i - 1] > potentialy_sorted_stuff[i] {
            return false;
        }
    }
    true
}