use std::{cmp::Ordering, iter::from_generator};
pub fn pancake_sort<T>(v: &[T]) -> impl Iterator<Item = Vec<T>>
where
T: Clone + PartialOrd,
{
pancake_sort_by(v, |a, b| a.partial_cmp(b))
}
pub fn pancake_sort_by<T, F>(v: &[T], compare: F) -> impl Iterator<Item = Vec<T>>
where
F: Fn(&T, &T) -> Option<Ordering> + Copy,
T: Clone,
{
let mut state = v.to_vec();
from_generator(move || {
yield state.to_vec();
for i in (1..=state.len()).rev() {
let max_index = find_max_index(&state[..i], compare);
if max_index != i - 1 {
if max_index != 0 {
flip(&mut state, max_index);
yield state.to_vec();
}
flip(&mut state, i - 1);
yield state.to_vec();
}
}
})
}
fn flip<T>(v: &mut [T], index: usize)
where
T: Clone,
{
v[..=index].reverse();
}
fn find_max_index<T, F>(v: &[T], compare: F) -> usize
where
F: Fn(&T, &T) -> Option<Ordering> + Copy,
{
let mut max_index = 0;
for i in 1..v.len() {
if compare(&v[max_index], &v[i]) == Some(Ordering::Less) {
max_index = i;
}
}
max_index
}