Category: Algorithm

This video is good to help: I have also taken help from DS Made Easy by Karumanchi…

PSeudoCode: selectionSort(A,n) { for(i=0 to n-1) { min=i; for(j=i+1 to n){ if(arr[j]<arr[min]){ min=j; } } if(min!=i) {…

PSeudoCode: selectionSort(A,n) { for(i=0 to n-1) { min=i; for(j=i+1 to n){ if(arr[j]<arr[min]){ min=j; } } if(min!=i) {…

PSeudoCode: selectionSort(A,n) { for(i=0 to n-1) { min=i; for(j=i+1 to n){ if(arr[j]<arr[min]){ min=j; } } if(min!=i) {…

Youtube Video: Analaysis though it seems little bit tough to me: HackerRank video: MIT video: https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/lecture-4-quicksort-randomized-algorithms/ Pseudo Code…

code: #include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define mp make_pair #define ff…