The Selection Sorting Algorithm in VBScript
The selection sort, similar to insertion sort, is one of the simple sorting algorithm that has O(N^2) time complexity. The selection sorting algorithm is quadratic, thus not efficient when …
Find the Queens That Can Attack the King
On an 8×8 chessboard, there can be multiple Black Queens and one White King. Given an array of integer coordinates queens that represents the positions of the Black Queens, …
C++ Coding Reference: is_sorted_until() and is_sorted()
We talked about sorting (unstable and stable) algorithms implemented in C++ STL. The STL algorithm header also provides the is_sorted_until() and is_sorted() which returns the first out-of-order element in …
Two Rectangles Overlap Detection Algorithm in C++
A rectangle is represented as a list , where (x1, y1) are the coordinates of its bottom-left corner, and (x2, y2) are the coordinates of its top-right corner. Two …
C++ Coding Reference: next_permutation() and prev_permutation()
C++ algorithm header provides you access to next_permutation() and prev_permutation() which can be used to obtain the next or previous lexicographically order. With an array or vector or string …
C++ Coding Reference: count and count_if
Novice C++ programmers usually write a simple for loop if they want to count number of particular elements in the array – which could be entirely replaced by STL::count …