Efficiently Merging Large Sorted Files
The solution involves using an external Merge sort algorithm for handling data that cannot fit into memory. We’ll use a two-pointer technique.
Category: C/C++
C++ Standard Template Library (STL) – [Deque]
Deque is a double-ended queue that provides dynamic resizing and efficient insertion and deletion of elements from both ends.
Finding the Next Lexicographically Greater Permutation
Given an input sequence in the form of an array, find the lexicographically next greater permutation if it exists.
Mersenne Twister Algorithm vs rand(): Generating Random Numbers
Understanding the differences between the Mersenne Twister algorithm and rand() method helps in selecting the appropriate method based on specific programming needs.
Different ways to iterate over C++ Vector
A vector is a data structure for maintaining a set of elements having a specific data type.
Here, we’ll learn about various ways to iterate over a C++ Vector. (Some of the following ways could also be used with other C++ containers like list, queue, map etc.)
C Revision (Quick Notes)
Importance of main: main() function is the first function to be executed in the program. All the remaining functions in the program are called from main().
Custom Comparators in C++
Custom Comparators are used to compare the members or objects of user-defined containers (class/data structure).
Bitmasking
You’ve N elements and you need to find the subsets of these N elements where zero or more of the N elements are included or excluded.
C++ Standard Template Library (STL) – [Pair and Tuple]
Pair in C++ STL is used to combine two values having different or same data types. It stores two different values as a single element. Tuple unlike pair can be used to combine two or more than two values having different or same data types.
map vs unordered_map in C++ Standard Template Library (STL)
Internally, the elements in the unordered_map are not sorted in any particular order with respect to either their key or values (unlike map)