Search for a command to run...
Articles tagged with #dsa
Binary Search is used on sorted Arrays. 馃З Binary Search works if : There exists a monotonic relationship in your search space 鈥攖hat is, a point divides the domain into two consistent halves: The left half satisfies one condition (e.g., false), Th...
In this article we will be solving problems on arrays EASY QUESTIONS Smallest Missing Multiple of K class Solution { public: int missingMultiple(vector<int>& nums, int k) { unordered_set<int> s(nums.begin(), nums.end()); while(tr...
A function calls itself until specific condition is met. Example: void print(int now, int target){ if(now==target) return; cout<<now<<endl; print(now+1, target); } int main(){ print(1,11); return 0; } What if there鈥檚 no if condi...
Popular sorting techniques include: Selection sort Bubble sort Insertion sort Merge sort Quick sort Selection Sort void selectionSort(vector<int>& arr){ int n = arr.size(); for(int i = 0; i < n; i++){ int minimum = i; f...