## Binary search algorithm

0 likes • Nov 19, 2022 • 0 views
Python

## More Python Posts

#### Distinct Primes Finder > 1000

0 likes • Nov 18, 2022 • 3 views
Python
```primes=[]products=[]
def prime(num):    if num > 1:        for i in range(2,num):            if (num % i) == 0:                return False        else:            primes.append(num)            return True
for n in range(30,1000):    if len(primes) >= 20:        break;    else:        prime(n)
for previous, current in zip(primes[::2], primes[1::2]):    products.append(previous * current)    print (products)```

#### primes numbers finder

0 likes • Mar 12, 2021 • 1 view
Python
```prime_lists=[] # a list to store the prime numbers
def prime(n): # define prime numbers    if n <= 1:        return False    # divide n by 2... up to n-1    for i in range(2, n):        if n % i == 0:  # the remainder should'nt be a 0            return False    else:        prime_lists.append(n)        return True

for n in range(30,1000):  # calling function and passing starting point =30 coz we need primes >30    prime(n)
check=0 # a var to limit the output  to 10 onlyfor n in prime_lists:    for x in prime_lists:        val=  n *x        if (val > 1000 ):            check=check +1        if (check <10) :            print("the num is:", val , "=",n , "* ", x )        break```

#### ZapFinder

0 likes • Jan 23, 2021 • 0 views
Python
`import subprocess   #for the praat callsimport os   #for ffmpeg and the pause call at the end#Even if we wanted all videos being rendered asynchronously, we couldn't see progress or errorsimport glob #for the ambiguous filesimport tempfileaudioFileDirectory = 'Audio Files'timeList = {}fileList = glob.glob(audioFileDirectory + '\\*.wav')pipeList = {}for fileName in fileList:    arglist = ['Praat.exe', '--run', 'crosscorrelateMatch.praat', 'zeussound.wav', fileName, "0" , "300"]    print(' '.join(arglist))    pipe = subprocess.Popen(arglist, stdout=subprocess.PIPE)    pipeList[fileName[len(audioFileDirectory)+1:-4]] = pipe #+1 because of back slash, -4 because .wav#for fileName, pipe in pipeList.items():#    text = pipe.communicate()[0].decode('utf-8')#    timeList[fileName] = float(text[::2])for fileName, pipe in pipeList.items():    if float(pipe.communicate()[0].decode('utf-8')[::2]) > .0003:    #.000166 is not a match, and .00073 is a perfect match. .00053 is a tested match        arglist = ['Praat.exe', '--run', 'crosscorrelate.praat', 'zeussound.wav', audioFileDirectory + '\\' + fileName + '.wav', "0" , "300"]        print(' '.join(arglist))        text = subprocess.Popen(arglist, stdout=subprocess.PIPE).communicate()[0].decode('utf-8')        timeList[fileName] = float(text[::2])clipLength = 10for fileName, time in timeList.items():    arglist = ['ffmpeg', '-i', '"'+fileName+'.mp4"', '-ss', str(time-clipLength), '-t', str(clipLength*2), '-acodec', 'copy' , '-vcodec', 'copy', '"ZEUS'+ fileName + '.mp4"']    print(' '.join(arglist))    os.system(' '.join(arglist))tempFile = tempfile.NamedTemporaryFile(delete=False)for fileName in glob.glob('ZEUS*.mp4'):    tempFile.write(("file '" + os.path.realpath(fileName) + "'\n").encode());tempFile.seek(0)print(tempFile.read())tempFile.close()arglist = ['ffmpeg', '-safe', '0', '-f', 'concat', '-i', '"'+tempFile.name+'"', '-c', 'copy', 'ZeusMontage.mp4']print(' '.join(arglist))os.system(' '.join(arglist))os.unlink(tempFile.name)    #Delete the temp file#print(timeList)os.system('PAUSE')`

#### Print pyramid pattern

0 likes • Nov 19, 2022 • 0 views
Python
`def print_pyramid_pattern(n):         # outer loop to handle number of rows    # n in this case    for i in range(0, n):             # inner loop to handle number of columns        # values changing acc. to outer loop        for j in range(0, i+1):                     # printing stars            print("* ",end="")              # ending line after each row        print("\r") print_pyramid_pattern(10)`

#### Using logic with sets

0 likes • Nov 18, 2022 • 0 views
Python
```#SetsU = {0,1,2,3,4,5,6,7,8,9}P = {1,2,3,4}Q = {4,5,6}R = {3,4,6,8,9}
def set2bits(xs,us) :    bs=[]    for x in us :        if x in xs :            bs.append(1)        else:            bs.append(0)    assert len(us) == len(bs)    return bs
def union(set1,set2) :    finalSet = set()    bitList1 = set2bits(set1, U)    bitList2 = set2bits(set2, U)
for i in range(len(U)) :        if(bitList1[i] or bitList2[i]) :            finalSet.add(i)
return finalSet
def intersection(set1,set2) :    finalSet = set()    bitList1 = set2bits(set1, U)    bitList2 = set2bits(set2, U)
for i in range(len(U)) :        if(bitList1[i] and bitList2[i]) :            finalSet.add(i)
return finalSet
def compliment(set1) :    finalSet = set()    bitList = set2bits(set1, U)
for i in range(len(U)) :        if(not bitList[i]) :            finalSet.add(i)
return finalSet
def implication(a,b):    return union(compliment(a), b)
#################################################################################################################         Problems 1-6         ##################################################################################################################################
#p \/ (q /\ r) = (p \/ q) /\ (p \/ r)def prob1():    return union(P, intersection(Q,R)) == intersection(union(P,Q), union(P,R))
#p /\ (q \/ r) = (p /\ q) \/ (p /\ r)def prob2():    return intersection(P, union(Q,R)) == union(intersection(P,Q), intersection(P,R))
#~(p /\ q) = ~p \/ ~qdef prob3():    return compliment(intersection(P,R)) == union(compliment(P), compliment(R))
#~(p \/ q) = ~p /\ ~qdef prob4():    return compliment(union(P,Q)) == intersection(compliment(P), compliment(Q))
#(p=>q) = (~q => ~p)def prob5():    return implication(P,Q) == implication(compliment(Q), compliment(P))
#(p => q) /\ (q => r)  =>  (p => r)def prob6():    return implication(intersection(implication(P,Q), implication(Q,R)), implication(P,R))

print("Problem 1: ", prob1())print("Problem 2: ", prob2())print("Problem 3: ", prob3())print("Problem 4: ", prob4())print("Problem 5: ", prob5())print("Problem 6: ", prob6())
'''Problem 1:  TrueProblem 2:  TrueProblem 3:  TrueProblem 4:  TrueProblem 5:  TrueProblem 6:  {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}'''```

#### Bitonic sort

0 likes • Nov 19, 2022 • 0 views
Python
```# Python program for Bitonic Sort. Note that this program# works only when size of input is a power of 2.
# The parameter dir indicates the sorting direction, ASCENDING# or DESCENDING; if (a[i] > a[j]) agrees with the direction,# then a[i] and a[j] are interchanged.*/def compAndSwap(a, i, j, dire):	if (dire==1 and a[i] > a[j]) or (dire==0 and a[i] > a[j]):		a[i],a[j] = a[j],a[i]
# It recursively sorts a bitonic sequence in ascending order,# if dir = 1, and in descending order otherwise (means dir=0).# The sequence to be sorted starts at index position low,# the parameter cnt is the number of elements to be sorted.def bitonicMerge(a, low, cnt, dire):	if cnt > 1:		k = cnt/2		for i in range(low , low+k):			compAndSwap(a, i, i+k, dire)		bitonicMerge(a, low, k, dire)		bitonicMerge(a, low+k, k, dire)
# This funcion first produces a bitonic sequence by recursively# sorting its two halves in opposite sorting orders, and then# calls bitonicMerge to make them in the same orderdef bitonicSort(a, low, cnt,dire):	if cnt > 1:		k = cnt/2		bitonicSort(a, low, k, 1)		bitonicSort(a, low+k, k, 0)		bitonicMerge(a, low, cnt, dire)
# Caller of bitonicSort for sorting the entire array of length N# in ASCENDING orderdef sort(a,N, up):	bitonicSort(a,0, N, up)
# Driver code to test abovea = [3, 7, 4, 8, 6, 2, 1, 5]n = len(a)up = 1
sort(a, n, up)print ("\n\nSorted array is")for i in range(n):	print("%d" %a[i]),```