hello

I want the time complexity for this pseudocode and how we got it step by step with explanations also the best case and worst case of the algorithm in details

thank you

import csv import time import pandas as pd

path = r"C:/Users/vip/Desktop/project/pcr_data.csv"

# making data frame from csv file # change data type from int to str data = pd.read_csv(path) data = data.astype(str)

def readlist(): with open("pcr_data.csv",'r') as csvfile: reader = csv.reader(csvfile) dataList = [] # definition empty list for row in reader: dataList.append(row) return dataList

# start time complixity start_time = time.perf_counter()

def editDistance(str1, str2, m, n):

# If first string is empty, the only option is to # insert all characters of second string into first if m == 0: return n # If second string is empty, the only option is to # remove all characters of first string if n == 0: return m

# If last characters of two strings are same, nothing # much to do. Ignore last characters and get count for # remaining strings.

if str1[m-1] == str2[n-1]: return editDistance(str1, str2, m-1, n-1)

# If last characters are not same, consider all three # operations on last character of first string, recursively # compute minimum cost for all three operations and take # minimum of three values.

return 1 + min(editDistance(str1, str2, m, n-1), #insert editDistance(str1, str2, m-1, n), #remove editDistance(str1, str2, m-1, n-1) #replace )

# output for two string's str1 = data.loc[30] print("String 1 : ",list(str1))

str2 = data.loc[100] print("String 2 : ",list(str2))

print ("Edit Distance By Using LIST : " , editDistance(str1, str2, len(str1), len(str2)))

# end time complixity end_time = time.perf_counter() print("Time Taken Is : ", end_time - start_time , "Second")

# This code is contributed by Bhavya Jain