Linear & Binary Search Code | Big O Notation

Check out our courses:

Coupon: TELUSKO10 (10% Discount)

Coupon: TELUSKO20 (20% Discount)

For More Queries WhatsApp or Call on : [phone]

Udemy Courses:

More Learning :

Donation:
PayPal Id : navinreddy20

[AdarshaCoder]

Thank you for your explanation on finding the Time complexity Sir... this is fitting inside my head without any doubts... Keep uploading the videos daily

[nilakantas]

Thank you very much for your DSA tutorial sir 🙏🙏

[rajenderprasad]

Awesome.. you make everything easy to understand sir. Thank you

[byxzkvt]

Thank you so much sir for your DSA tutorials. Sir please upload the remaining DSA tutorials also. It will be really helpful to learn the remaining lectures. Thank you sir.

[aravindbandla]

Very good explanation Sir, can you please upload videos on remaining topics in DSA.

[Motivationisthekeytosucces]

one of the best explanations i've ever seen <3

[husseinhadliye]

hi @Telusko thanks for good explanation i would be greet if you could make PYTHON instead of JAVA

[AnietieDickson-zhsl]

i have chosen you today to be my best tutor

[Dark-Ace-YT]

Sir please Upload the remaining DSA videos it helps me to understand the concepts sir.

[lovelySamayal]

Binary search is only for sorted collection?

[jatinsharma]

didn't understand binary search because you were not defining the pointer after changing the position. I had to follow the other resources to understand this concept.

[MaazKhan-tnwb]

Plz When are you Continue the Series you tell that you will continue this in the 1 week of sep?

[sgr]

Very good explanations sir. I have a doubt "your Binary search algorithm will work only if the list elements are in ascending order, Is my understanding correct?"

[iamlegend]

Very nice sir... But to understand java for other language students is little bit complicated

[darshankharade]

can you please provide a source please sir

[ajaybhosale]

public class Program
{
public static void Main()
{
int[] arr = new int[] { 1, 2, 4, 5, 8, 13, 17, 18, 21};
int a = 17;
int count=0;

for(int i=0;i<arr.Length;i++)
{
if (a ==arr[i])
{
Console.WriteLine(a+" : is avaible with index : " +i);
}
else
{
count++;
}
}
if(count==arr.Length)
{
Console.WriteLine("it is not avaible please check another one...");
}

Console.WriteLine("program is executed...");

Console.ReadKey();
}

}