Skip to content
This repository was archived by the owner on Feb 7, 2026. It is now read-only.
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
435 changes: 387 additions & 48 deletions Python-ifed.ipynb

Large diffs are not rendered by default.

Binary file added __pycache__/ability.cpython-38.pyc
Binary file not shown.
Binary file added __pycache__/ability.cpython-39.pyc
Binary file not shown.
Binary file added __pycache__/nearest_square.cpython-38.pyc
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
9 changes: 9 additions & 0 deletions ability.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
import requests
def ability(name):
url = "http://pokeapi.co/api/v2/pokemon/"+name+"/"
data = requests.get(url).json()
abilitly=[]
for i in data["abilities"]:
abilitly.append(i['ability']['name'])
return abilitly

7 changes: 7 additions & 0 deletions nearest_square.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
import math

def nearest_square(n):
if(n<=0):
return 0
else:
return(math.floor(n**0.5)**2)
56 changes: 56 additions & 0 deletions step_4.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,56 @@
import time
import numpy as np


def func1(all_elements, subset_elements):
"""Description:The default way to find the intersection of two sets
"""
start = time.time()
verified_elements = []
for element in subset_elements:
if element in all_elements:
verified_elements.append(element)

print(len(verified_elements))
print('Duration: {} seconds'.format(time.time() - start))


def func2(all_elements, subset_elements):
"""Description:The method of finding intersection of two sets using built-in function of numpy-intersect1d
"""
start = time.time()
verified_elements = np.intersect1d(np.array(subset_elements), np.array(all_elements))

print(len(verified_elements))
print('Duration: {} seconds'.format(time.time() - start))


def func3(all_elements, subset_elements):
"""Description:The method of finding intersection of two sets using set data structure of Python
"""
start = time.time()
verified_elements = set(subset_elements) & set(all_elements)

print(len(verified_elements))
print('Duration: {} seconds'.format(time.time() - start))


with open('subset_elements.txt') as f:
subset_elements = f.read().split('\n')

with open('all_elements.txt') as f:
all_elements = f.read().split('\n')


def main():
print(func1.__doc__)
func1(all_elements, subset_elements)

print(func2.__doc__)
func2(all_elements, subset_elements)

print(func3.__doc__)
func3(all_elements, subset_elements)

if __name__ == "__main__":
main()
File renamed without changes.
1 change: 1 addition & 0 deletions tempCodeRunnerFile.py
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@