brother your videos are extremely useful, thanks a ton❤
@Roshan-tq1yb5 ай бұрын
first i saw this video is not understandable ,after watching 3 to 4 times ,it is a perfect video with super explanation.Thank you bro
@srinivas37777 ай бұрын
Super explanation bro
@ragul12art Жыл бұрын
Thank you bro🎉
@PrabaKaranB-6 ай бұрын
🎉❤ perfect
@sanjayraj88302 ай бұрын
bro neenga 3 while loops use panirikeenga time complexity o(n*3) thana varum
@codemeal2 ай бұрын
Namma 3 while loops separate ah use pandrom bro, nested loops ah use panala, so tc O(3n) varum, common ah atha O(n) nu than solluvom while (condition): while (condition): while(condition): **Any code** ipdi irunthathan O(n^3) varum bro, nammaloda code while(condition) any code while(condition) any code while(condition) any code ithu ungaluku understand aahum nu ninaikiren bro
@sanjayraj88302 ай бұрын
@@codemeal semma bro
@scsSIVA Жыл бұрын
merge and sort: arr1=[4,2,5] arr2=[6,1,3] time complexity=o(n) space ccomplexity=o(n) how to possible?
@codemeal Жыл бұрын
Not O(n) bro NlogN varum
@scsSIVA Жыл бұрын
@@codemeal illa bro na geeksforgeeks website la parthen this problem...
@scsSIVA Жыл бұрын
@@codemeal ok but one array use panni Mergesort pannalam .. Two arrays use panni epadi Mergesort pandrathu..