Majority of the code belongs to the original cpython which can be found at https://github.com/python/cpython
All the copyright is owned by the official python and this is just a variant of it as a personal project.
I have installers for utnampython which can be found here
installer for 64 bit architecture is here
installer for 32 bit architecture is here
PCbuild\build.bat -p x64 -c Release
PCbuild\build.bat -p win32 -c Release
utnampython -m ensurepip
utnampython -m pip install package_name
this tte() function takes a string as input and returns the python expression for that mathematical expression string
e.g: 1
print(tte("13pi12"))
Output:
13*math.pi*12
e.g: 2
print(tte("2pilnlnln134^e/17sqrtpi"))
Output:
2*math.pi*(math.log(math.log(math.log(134))))**math.e/(17)*(math.sqrt(math.pi))
this function saves the output of the latest program on terminal and copies it in a txt file. It takes the filename you want to save the file with and append date and time suffix with it and creates the file.
just add the write_out() at the end of your code
for i in range(1, 11, 1):
print(i)
write_out()
from utnalgo.Graph.traversal import bfs, dfs, dijkstra, a_star, bellman_ford, prims, kruskal
# sadly, due to commit issues I lost the 10+ functions like is_ramanujan, is_palindrome which where added to the utnalgo.Numbers
from utnalgo.Numbers import is_prime
15+ functions take array of numbers as input and return the sorted array.
Each takes parameters array, reversed=false
form utnalgo.Sort.sort_algos import selection_sort(), bubble_sort(), insertion_sort(), tim_sort(), quick_sort(), merge_sort(), counting_sort(), radix_sort(), bucket_sort(), heap_sort(), shell_sort(), cocktail_shaker_sort(), comb_sort(), gnome_sort(), cycle_sort(), pigeonhole_sort()
strassen takes two matrices as input and returns their product
from utnalgo.matrix import strassen
searching functions to search through an array of numbers.
parameters: array, tagret
from utnalgo.utnsearch import binary_search, binary_search_2d, linear_search, interpolation_search