Skip to content

[Andrei Tulpan] algorithms_task_6 #558

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
andreitulpan wants to merge 1 commit into
base: master
Choose a base branch
from
Open

[Andrei Tulpan] algorithms_task_6 #558

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions algorithms_task_6/student/include/impl.h
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,16 @@
#pragma once
#include <algorithm>
#include <list>

template <typename Container>
void stable_sort(Container& target) {
std::stable_sort(target.begin(), target.end());
}

template<typename T>
void stable_sort(std::list<T>& target) {
target.sort();
}

/**
* @todo insert_to_sorted
Expand All @@ -18,4 +28,7 @@ void insert_to_sorted(Sequence& target, const FwIt sourceBegin, const FwIt sourc
static_assert(std::is_const<typename std::remove_reference<
typename std::iterator_traits<FwIt>::reference>::type>::value,
"FwIt must point to const data");

std::copy(sourceBegin, sourceEnd, std::back_inserter(target));
Copy link
Owner

@smay1613 smay1613 Feb 26, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

consider search + insertion

stable_sort(target);
}