{"id":2442,"date":"2016-05-23T17:36:22","date_gmt":"2016-05-23T21:36:22","guid":{"rendered":"http:\/\/local.brightwhiz\/?p=2442"},"modified":"2021-12-18T05:35:00","modified_gmt":"2021-12-18T10:35:00","slug":"modifying-algorithms","status":"publish","type":"post","link":"http:\/\/local.brightwhiz\/modifying-algorithms\/","title":{"rendered":"The C++ Standard Template Library Modifying Algorithms – Part 8"},"content":{"rendered":"\n
Welcome to the eighth and final part of our C++ Standard Template Library<\/a> series. In this eighth part, we will be discussing in brief Modifying Algorithms. This series comes to an end even though some quick and dirty research will show the STL is rather large.<\/p>\n\n\n\n The reason we are stopping here is to change the focus to talking about other libraries like Boost<\/a> and Qt<\/a>. More importantly, we will be starting our C++<\/a> tutorial series on modern C++ which will include videos on our Partner YouTube Channel.<\/p>\n\n\n\n As usual, if you are catching up with us now I would like to direct you to the start of this series<\/a>. If you have some knowledge in STL then you can fast track to ore recent articles in this series. So without much ado, we will pick up from where we left off on talking about Non-Modifying algorithms<\/a>.<\/p>\n\n\n\n In simplest terms, Modifying Algorithms can be described as those algorithms that alter the data on which they are applied to operate on. For example, if I apply an algorithm to change the order of elements in an array and return the array with the new order, that algorithm can be termed as a modifying algorithm.<\/p>\n\n\n\nWhat are Modifying Algorithms?<\/h2>\n\n\n\n