CPP – Partial Sort Algorithm

We need not sort all elements sometimes. Here are a few simple examples of STL algorithms partial_sort, nth_element, and partition. partial_sort For example, find the 5 biggest ones in 10 random numbers. #include <iostream> #include <vector> #include <cstdlib> #include <ctime> #include <algorithm> using namespace std; int main() { vector<int> values; Read more…

CPP – copy_if

The algorithm copy_if is useful, it can help us to get all elements that meet special conditions. C++ template OutputIt copy_if( InputIt first, InputIt last, OutputIt d_first, UnaryPredicate pred ); Possible implement: C++ template OutputIt copy_if(InputIt first, InputIt last, OutputIt d_first, UnaryPredicate pred) { while (first != last) { if Read more…

CPP – Unique Copy In STL

std::unique_copy is an algorithm which can be used to copy elements without duplicating objects in adjacent locations. template< class InputIt, class OutputIt > OutputIt uniquecopy( InputIt first, InputIt last, OutputIt dfirst ); Usage example: C++ #include #include #include #include int main() { std::string s1 = “This is a story about Read more…

Tex To PDF
: convert the Latex file which suffix is tex to a PDF file

X