Skip to main content

Programming Verse

Search This Blog

PYTHON program to do binary search on a list

Posted by Ankit Josh on December 09, 2020

Get link
Facebook
X
Pinterest
Email
Other Apps

Python program to do binary search on a list

Program :

Output :

ankitjosh binary binary search josh python searching

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Post a Comment

Popular Posts

JAVA program to find initials of a name

We have approached this problem in two different ways, would encourage you to take a look at bothe the approaches. Naive Approach : Step-1 : Finding the last index of white space. Step-2 : Looping through all the characters before the the last white space. Step-3 : If a character is a white space, then adding the next character to the initials string. (In order to get the first word make sure to add a white space in front of the name string). Step-4 : At last adding the last name to the initials string. Program : Sample Output : Better Approach : Step-1 : Extracting all the words from the name string in to an array. Step-2 : Looping through all the words in the array before the last word. Step-3 : Adding the first character of each word in to the initials string. Step-4 : At last adding the last word to the initials string. Program : Sample Output :

PYTHON program to check if a number is prime or not

Python program to check if a number is prime or not Naive Approach : Key Idea : We can simply check for every number from 2 to n if it is a factor of n Program : Optimized Approach : Key Idea : If n is not a perfect square then it can be represented as pairs of (a,b) i.e:(a*b)=n and for perfect square it will be a*a=n. So,a=sqrt(n). This means that for a "n" if it is not a perfect square, we can say that the pairs occur in way where one pair is always less than sqrt(n) and other one greater than sqrt(n). : Proof : Let's say I'm wrong ,then there can be 3 possibilities. "If both a and b < sqrt(n)" So,"a < sqrt(n) and b < sqrt(n) and a*b< n (which is wrong)". "We can say the same for both a and b > sqrt(n)" "Thus, the only way that's possible is if a < sqrt(n) and b > sqrt(n). " "Except if the number is a perfect square in which case we need to check the sqrt(n) number as well. So o...

JAVA program for Highest Common Factor (HCF) of two numbers

HCF can be found by using the Euclidean Algorithm . The Euclidean Algorithm is an efficient algorithm for finding the HCF of two numbers quickly. We have performed the algorithm using a while loop as well as a recursive method. We would encourage you to use the recursive method if recursion is familiar to you. Euclidean Algorithm : Step-1 : If 'A' = 0 then HCF is 'B'. Since zero is divisible by any number. Step-2 : If 'B' = 0 then HCF is 'A'. Since zero is divisible by any number. Step-3 : Find the remainder 'R' of 'A' divided by 'B'. Step-4 : Find the HCF of 'B' and 'R' using the previous step, which gives you the HCF of 'A' and B itself. This is simplified version of the Euclidean Algorithm. We would encourage you to read the Khan Academy explanation article here . Programming Approach : Step-1 : Take input two numbers 'A' and 'B'. Step-2 : Loop or recurse until 'B' = zero. Step...

Archive

May 20211
December 202012
February 20191

Amanpreet Kaur Visit profile
Ankit Josh Visit profile
Rohan Deb Sarkar Visit profile
Sourav Sarkar Visit profile

Powered by Blogger

Original Content By Programming Verse