Leagend watching it one day before exam π π π π π
Already memorised the algo for exam but now that you shown the real life example, it's crystal clear. Thank you sir
Best Teacher ever I have seen on Youtube πAppreciation from Pakistan π΅π°
Your pedagogy is unique and focused on gate aspirants.. Thank u sir!
Great sir, Computer science has been easy to understand by you only thanks sir
Ultra legend watching it exam day in morning π
It always helps to write the output in the comments of your first traveral, then the program would run in the first go... public class InsertionSort { public static void main(String[] args) { int[] a = {77, 23, 54, 223, 101, 65, 283, 99, 300, 1}; for (int j = 1; j < a.length; j++) { int newElement = a[j]; //23 int i = j - 1; // 0 while (i >= 0 && newElement < a[i]) { a[i + 1] = a[i]; // {77, 77, ...} i = i - 1; // i = -1 } a[i+1] = newElement; // {23, 77, ...} } // printing the sorted array for (int i = 0; i < a.length; i++) { System.out.println(a[i]); } } }
Great lecture sir...All the concepts related to this sorting technique (working,example,complexity) in one video and well explained..Thank you sir
Great & Very Helpful Video,Thankyou sir.
void insertionSort(int A[], int n) { int i, j, temp; for (i = 1; i < n; i++) { temp = A[i]; for (j = i - 1; j >= 0; j--) { if (A[j] > temp) { A[j + 1] = A[j]; A[j] = temp; } else { break; } } } } code in C of insertion sort algo
Legend watching it in computer lab 10 min before viva
Sir, your teaching style is so attractive, thank-you. Huge respect from PAKISTAN
Amazing ππ
u are incredible ...one of best tutor on YouTube
Very nice sir Great explanation πππ
And Most Important Your Teaching style is Amazing I watch Your videos and I Understand each and Everything about Topics
All subjects of CSE becomes very easy only because of you Sir . Superb explanation ππ
one of the best teacher for data structure .....
Great one!
@Nizamkakar