ActionList al;
GeneOrder temp(go);
while(inversionDistance(temp) > 0){
- cout << "Distance: " << inversionDistance(temp) << " : ";
- copy(temp.begin(), temp.end(), ostream_iterator<int>(cout, " "));
- cout << endl;
+ //cout << "Distance: " << inversionDistance(temp) << " : ";
+ //copy(temp.begin(), temp.end(), ostream_iterator<int>(cout, " "));
+ //cout << endl;
ActionList safe = safeActions(temp);
if (safe.size() > 0){
safe[0](temp);
- cout << "Action: " << safe[0].toString() << " ";
+ cout << "Action: " << safe[0].toString() << endl;
al.push_back(safe[0]);
}else
return ActionList(); //TODO: Need to handle hurdles.
if (intervals[i].oriented && intervals[i].first != intervals[i].second){
SortAction sa(new ReverseAction(intervals[i]));
size_t score = scoreAction(go,sa);
- cout << "Inversion: " << min(intervals[i].first,intervals[i].second) << ":" << max(intervals[i].first,intervals[i].second)-1 << " Score: " << score << endl;
+ //cout << "Inversion: " << min(intervals[i].first,intervals[i].second) << ":" << max(intervals[i].first,intervals[i].second)-1 << " Score: " << score << endl;
pq.push(pair<size_t,SortAction>(score,sa));
}
}