#include <cstdio>
#include <memory>
#include <utility>
#include "sorters.hpp"
using namespace std;


SteppedBsort::SteppedBsort(shared_ptr<SortInput> input): data(input) {};

bool SteppedBsort:: step(){
	if(is_finished==true) {
		printf("finished");
		return true;
			}
	if(data->values[j]>data->values[j+1])
		{
			swap(data->values[j], data->values[j+1]);
		}
	j++;
	if(j>=data->values.size()-1 -i){
		j=0;
		i++;
	}

	if (i==data->values.size()-1){
		is_finished=true;
	}

	return false;
}