can you improve the code$($question is Develop linear and binary search algorithms to find specific student records or def linear$\_$search$($data$,$ key, value$)$:

results $=[]$

for index, row in data.iterrows$()$:

if row$[$key$]==$ value:

results.append$($row$)$

return results

# Example usage: Find all students in the $"$GP$"$ school

results $=$ linear$\_$search$($student$\_$data, 'school', $\text{'}$GP$\text{'})$

for result in results:

print$($result$)$performance data$)$

def binary$\_$search$($data$,$ key, value$)$:

left, right $=0,$ len$($data$)-1$

results $=[]$

while left $<=$ right:

mid $=($left $+$ right$)//2$

if data.iloc$[$mid$][$key$]==$ value:

results.append$($data$.$iloc$[$mid$])$

# Search for duplicates on both sides

l$,$ r $=$ mid $-1,$ mid $+1$

while l $>=0$ and data.iloc$[$l$][$key$]==$ value:

results.append$($data$.$iloc$[$l$])$

l $-=1$

while r $<$ len$($data$)$ and data.iloc$[$r$][$key$]==$ value:

results.append$($data$.$iloc$[$r$])$

r $+=1$

break

elif data.iloc$[$mid$][$key$]<$ value:

left $=$ mid $+1$

else:

right $=$ mid $-1$

return results

# Example usage: Find a student with the ID $123($assuming we have an $\text{'}$id$\text{'}$ column$)$

# Ensure the DataFrame is sorted by the $\text{'}$id$\text{'}$ column

sorted$\_$data $=$ student$\_$data.sort$\_$values$($by$=\text{'}$id$\text{'}).$reset$\_$index$($drop$=$True$)$

results $=$ binary$\_$search$($sorted$\_$data, $\text{'}$id$\text{'},123)$

for result in results:

print$($result$)$