1)MULTIPLYING TWO ARBITRARY BIG INTEGERS BY PYTHON
\n$$———————–$$
\ndef phi(i,array):
\narray[i+1]=int(array[i+1])+int(int(array[i])\/10)
\narray[i]=int(array[i])%10
\nreturn array<\/p>\n
#In this method I heavily use polynomial product and correcting the order. Any two integer can be multiplied in this program.
\n#Only one function was enough to proceed, phi(i,array). This function goes to the input index of given array and changes its value to the number remainder when divided by 10 and changes next index to + the previous number\/10, i.e., we make first school division.<\/p>\n
n1=input(“Enter First Integer : “)
\nn2=input(“Enter Second Integer: “)
\na=[]
\nb=[]
\nfor x in range(len(n1)):
\na.append(n1[x])
\nfor y in range (len(n2)):
\nb.append(n2[y])<\/p>\n
a=a[::-1]
\nb=b[::-1]<\/p>\n
s=[]
\nfor x in range(len(a)+len(b)-1):
\ns.append(0)<\/p>\n
for k in range (len(a)):
\nfor l in range (len(b)):
\ns[k+l]=s[k+l]+int(a[k])*int(b[l])<\/p>\n
for x in range (len(a)+len(b)-2):
\nphi(x,s)<\/p>\n
s=s[::-1]<\/p>\n
print(“Multiplication of “,n1,” and “,n2 ,”is :”,end=””)
\nf=1
\nfor i in s:
\nprint(i, end=””)
\n$$———————–$$<\/p>\n
2)SORTING CODE BY PYTHON
\n$$———————–$$<\/p>\n
def phi1(array):
\ns=array[0]
\nfor x in range (len(array)):
\nif(array[x]<s):
\ns=array[x]
\nreturn s<\/p>\n
def phi2(arr1,arr2,s):
\nfix=len(arr1)
\nx=0
\nwhile(x<fix):
\nif(s==arr1[x]):
\narr2.append(s)
\ndel arr1[x]
\nfix=fix-1
\nx=x+1
\nreturn arr2,arr1<\/p>\n
def filetoarray(filee):
\nU=open(filee,”r”)
\ny=[]
\nfor line in U:
\na=line.split()
\ny.append(float(a[0]))
\nU.close()
\nreturn y<\/p>\n
#MAIN
\nfilee=input(“Write the data name and press ‘ENTER’: “)<\/p>\n
y=filetoarray(filee)<\/p>\n
print(y)
\nprint(“Testing with sorted function:\\n”,sorted(y))<\/p>\n
s=[]
\nfix2=len(y)
\nwhile(len(s)<fix2):
\nphi2(y,s,phi1(y))
\nprint(“My result:\\n”,s)<\/p>\n
file = open(“sorted-result.txt”,”w”)
\nfor x in range (len(s)):
\nfile.write(str(s[x])+”\\n”)<\/p>\n
file.close()
\n$$———————–$$<\/p>\n
3)SIMPSON INTEGRATION BY PYTHON
\n$$———————–$$<\/p>\n
import math<\/p>\n
def filetoarray():
\n U=open(“S11.dat”,”r”)
\n y=[]
\n for line in U:
\n a=line.split()
\n y.append(float(a[0]))
\n U.close()
\n return y<\/p>\n
def valuesofF(array,f):
\n F=[]
\n for i in range(len(array)):
\n F.append(f(array[i]))
\n return F<\/p>\n
def simpsons(array,k):
\n F=k
\n U=F[0]+F[len(array)-1]
\n for x in range(1,len(array)-1):
\n if(x%2):
\n U=U+4*F[x]
\n continue
\n U=U+2*F[x]
\n U=U\/3*(array[len(array)-1]-array[0])\/(len(F)-1)
\n return U <\/p>\n
def functionstutoirals():
\n for x in range(len(“FUNCTION TUTOIRAL:”)):
\n print(“-“, end=””)
\n print(“\\nFUNCTION TUTOIRAL:”)
\n for x in range(len(“FUNCTION TUTOIRAL:”)):
\n print(“-“, end=””)
\n print(“\\nmath.sin(x)\\nReturn the sine of x (measured in radians)\\n”)
\n print(“math.sqrt(x)\\nReturn the square root of x\\n”)
\n print(“math.erf(x)\\nError function at x.\\n”)
\n print(“math.exp(x)\\nReturn e raised to the power of x.\\n”)
\n print(“math.log(x[, base])\\nReturn the logarithm of x to the given base.If the base not specified, returns the natural logarithm (base e)of x. \\n”)
\n print(“math.gamma(x)\\nGamma function at x.\\n”)
\n for x in range(len(“DATA:”)):
\n print(“-“, end=””)
\n print(“\\nDATA:”)
\n for x in range(len(“DATA:”)):
\n print(“-“, end=””)
\n print(“\\nmath.e = 2.718281828459045\\nmath.inf = inf\\nmath.nan = nan\\nmath.pi = 3.141592653589793…\\nmath.tau = 6.283185307179586\\n”)<\/p>\n
functionstutoirals()
\ny=filetoarray()
\nFF=eval(input(“Enter the function according to tutorial above: “))
\nj=valuesofF(y,FF)
\nprint(“\\n”,simpsons(y,j))<\/p>\n","protected":false},"excerpt":{"rendered":"
1)MULTIPLYING TWO ARBITRARY BIG INTEGERS BY PYTHON $$———————–$$ def phi(i,array): array[i+1]=int(array[i+1])+int(int(array[i])\/10) array[i]=int(array[i])%10 return array #In this method I heavily use polynomial product and correcting the order. Any two integer can be multiplied in this program. #Only one function was enough to proceed, phi(i,array). This function goes to the input index of given array and changes […]<\/a><\/p>\n","protected":false},"author":5643,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-41","page","type-page","status-publish","hentry","post-seq-1","post-parity-odd","meta-position-corners","fix"],"_links":{"self":[{"href":"https:\/\/blog.metu.edu.tr\/e221325\/wp-json\/wp\/v2\/pages\/41","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.metu.edu.tr\/e221325\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/blog.metu.edu.tr\/e221325\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/blog.metu.edu.tr\/e221325\/wp-json\/wp\/v2\/users\/5643"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.metu.edu.tr\/e221325\/wp-json\/wp\/v2\/comments?post=41"}],"version-history":[{"count":0,"href":"https:\/\/blog.metu.edu.tr\/e221325\/wp-json\/wp\/v2\/pages\/41\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.metu.edu.tr\/e221325\/wp-json\/wp\/v2\/media?parent=41"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}