@Nizamkakar

Sir app ko 2 sal se follow kar raha hon, is video ma pehle dafa dekha aap muskara rahe hain. khosh raho Sir❀

@MahmudulHasan-er4np

Already memorised the algo for exam but now that you shown the real life example, it's crystal clear. Thank you sir

@Kushaan_1

Your pedagogy is unique and focused on gate aspirants..
Thank u sir!

@nikhilpandeytm1829

Great sir, Computer science has been easy to understand by you only thanks sir

@SmartTech-tv1tu

Best Teacher ever I have seen on Youtube πŸ‘ŒAppreciation from Pakistan πŸ‡΅πŸ‡°

@shwetaadurkar562

Great lecture sir...All the concepts related to this sorting technique (working,example,complexity) in one video and well explained..Thank you sir

@Comedypoint06

Leagend watching it one day before exam πŸ˜…πŸ˜…πŸ˜…πŸ˜…πŸ˜…

@abdeali1301

Great & Very Helpful Video,Thankyou sir.

@kalpanameena9854

u are incredible ...one of best tutor on YouTube

@mr.unknown6577

And Most Important Your Teaching style is Amazing
I watch Your videos and I Understand each and Everything about Topics

@rabicca8646

Sir, your teaching style is so attractive, thank-you. Huge respect from PAKISTAN

@souravbhagat9979

Sir please vedios uplaod kijye aap YouTube pr design and analysis of algorthms pr.

@NAHEEDAABDULJABBARABDULJABBAR

Great sir ap K lecture zabardast Hai sub clear ho jahta ... Watching from Balochistan

@122_jyoti5

Sir thanku so much .your way of teaching awesome sir... Sir u r the key for all engineering  students... I wish your channel will grow more and more.... Sir thanku once again.

@gayathrib8610

Really sir , you explain all the topics very  interesting and also very easily.
Even though I don't know "Hindi" I can able to understand each and every word you say , that's crystal clear 😍

Till now , I haven't know how to calculate the Time complexity. But now, I understood only because of you sir 

I hope this playlist  on algorithms should be continued sir :-)

@safionweb

Happy to see you making progress. Nice setup.

@AjayKumar-cq7mz

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

@JitendraSingh-qd7jk

I can see that this code snippet is borrowed from the book called "BIBLE OF ALGORITHMS" ;Introduction TO algo by Thomas. You're literally perfect if you've read that.

@scorpion-5

much love and respect from pakistan apka way teaching boht acha hai easy hai bundle of thanks

@sagaradhikari8581

sir u are god for me , the way you explain each topic is way way better than others out there. love u a lot sir , keep making these videos . thank you