算法
简单排序搜索算法
Garybr0
网络安全爱好者
展开
-
广度优先搜索(python实现)
from collections import deque graph = {} graph["you"] = ["alice","bob","claire"] graph["bob"] = ["anuj",'peggy'] graph["alice"] = ["peggy"] graph["claire"] = ["thom","jonny"] graph["anuj"] = [] graph["peggy"] = [] graph["thom"] = [] graph["jonny"] = [] .原创 2020-11-26 17:41:27 · 405 阅读 · 0 评论 -
快速排序(python实现)
def quickSort(array): if(len(array)<2): return array else: pivot = array[0] less = [i for i in array[1:] if (i<pivot)] greater = [i for i in array[1:] if (i>pivot)] return quickSort(less) + [pivot]原创 2020-11-26 17:01:53 · 70 阅读 · 0 评论 -
选择排序(python实现)
def findSmallest(arr): smallest = arr[0] smallest_index = 0 for i in range(1,len(arr)): if(arr[i] < smallest): smallest = arr[i] smallest_index = i return smallest_index def selectionSort(arr): newArr原创 2020-11-26 16:47:27 · 60 阅读 · 0 评论 -
二分搜索(python实现)
def binary_search(list,item): low = 0 high = len(list)-1 while(low <= high): mid = (low + high)//2 guess = list[mid] if(item == guess): return mid if(item > guess): low = mid + 1原创 2020-11-26 16:25:25 · 209 阅读 · 0 评论