วีดีโอ

Keep on going sir we always with you 🙌

❤❤

Thank you so much sir

Super

Thanku so much sir🙌🙌

Supper ❤ sir telugu

Sir DBMS full chapters upload plz

A clg lo teach chestaru sir miru

I love you sir ❤

Sir meeru chala. Baga cheputunaru sir ..

Sir, header point is 35 moving towards left means we should smaller value sir?

sir code link kavali sir 🙌 nak exam undi sir

computer pantulu koddiga writing baga rayamdi

Helped Me A Lot Sir, Thank You Sir

Nice Telugu explanation

Sir your telugu lecture 😮 i were watch so many videos in English what ever it may be iam very excited your way of teaching sir😊

Thanku sir

Thank you sir❤

Thanks

Ur mailid ?? Sir I will send my daa syllabus sir

Sir please post the operating system notes of R22 Regulation 🙏

Sir please🙏🙏 forward the notes of operating system...R22 regulation

Tq sir tqs alot 😊

What is your name

Notes ekkada sir discription lo vuntundhi annar

Super explanation sir

Good information sir🎉

Sir 8 queen s problem sir

First view sir

N7ce explanation sir

implimentations of ADT

❤❤❤

Thank you so much sir🎉

Sir mekku Telugu vacha😮😮😮

Very Good sir 👍 Sir Your CSA lectures are very helpful for my exam great work sir

❤🎉

Sir me blog lo program chudamanaru bu t me description lo link evaledhu sir please share your link sir

Sir koncham program attach cheyandi sir

I came from ur @sudhakar Atchala channel , mee telugu youtube name chala bagundi keep going sir , we are with u ❤❤❤❤

Your videos are amazing sir

Anna pdf provide cheyara please 🙏

First like sir ❤

thank you sir 🙏

Sir u are god sir, only because of u iam able to understand ds

Thanks for explaining these topic sir

Your my teacher of my whole btech studies😊😊

Sir notes

#include <stdio.h> int BinarySearch(int [],int,int,int); int main() { int a[20],n,i,index,key; printf(" Enter size of the array"); scanf("%d",&n); printf(" Enter elements of the array"); for(i=0;i<n;i++) scanf("%d",&a[i]); printf(" Enter key element"); scanf("%d",&key); index=BinarySearch(a,0,n-1,key); if(index==-1) printf(" Key element is not found"); else printf(" Key element is found at %d index",index); return 0; } int BinarySearch(int a[],int low,int high,int key) { int mid; if(low<=high) { mid=(low+high)/2; if(key==a[mid]) return mid; else if(key<a[mid]) return BinarySearch(a,low,mid-1,key); else if(key>a[mid]) return BinarySearch(a,mid+1,high,key); } return -1; }

Sir super explanation 🎉