figure asearch( )bsearch( algorithm probabilitysearch(listitem prelist posta boolean indicating where the item is found or notin the former case swap founded item with its predecessor index while index list count and list[index item index index end while if index >list count or list[index item return false end if if index swap(list[index]list[index ] end if return true end probabilitysearch summary in this we have presented few novel searching algorithms we have presented more efficient searching algorithms earlier onlike for instance the logarithmic searching algorithm that avl and bst tree' use (defined in ss we decided not to cover searching algorithm known as binary chop (another name for binary searchbinary chop usually refers to its array counterpartas