Skip to content

Searching.rst

Latest commit

 

History

History
109 lines (71 loc) · 3.06 KB

Searching.rst

File metadata and controls

109 lines (71 loc) · 3.06 KB

Searching

Learning searching algorithms easily!

Quick Start Guide

# import the required searching algorithm
from pygorithm.searching import binary_search

myList = [12, 4, 2, 14, 3, 7, 5]

# pre-requisite for binary search is that the list should be sorted
myList.sort()

# to search an element in the above list
index = binary_search.search(myList, 7)
print(index)

Features

  • Searching algorithms available:
    • Linear Search (linear_search)
    • Binary Search (binary_search)
    • Breadth First Search (breadth_first_search)
    • Depth First Search (depth_first_search)
  • To see all the available functions in a module there is a modules() function available. For example,
>>> from pygorithm.searching import modules
>>> modules()
['binary_search', 'breadth_first_search', 'depth_first_search', 'linear_search']
  • For Searching: Remember search() function in binary_search module takes two parameters as a sorted list and the target element to be searched.
# import the required searching algorithm
from pygorithm.searching import binary_search

myList = [12, 4, 2, 14, 3, 7, 5]

# pre-requisite for binary search is that the list should be sorted
myList.sort()

# to search an element in the above list
index = binary_search.search(myList, 7)
print(index)
  • Get time complexities of all the searching algorithms
from pygorithm.searching import binary_search

# for printing time complexities of binary_search
print(binary_search.time_complexities())
  • Get the code used for any of the algorithm
from pygorithm.searching import binary_search

# for printing the source code of bubble_sort
print(binary_search.get_code())

Binary Search

  • Functions and their uses
    • search(List, key) : returns the position (index) of the key if key found, else returns -1. Note: List parameter must be sorted
    • time_complexities() : returns time complexities (Best, Average, Worst)
    • get_code() : returns the code for the binary_search.search() function

Linear Search

  • Functions and their uses
    • search(List, key) : returns the position (index) of the key if key found, else returns -1
    • time_complexities() : returns time complexities (Best, Average, Worst)
    • get_code() : returns the code for the linear_search.search() function

Breadth First Search

  • Functions and their uses
    • .. function:: search(graph, startVertex)

    graph : takes the graph data structures with edges and vertices startVertex : it tells the function the vertex to start with Return Value : returns the bfs for the graph

    • .. function:: time_complexities()

    Return Value : returns time complexities

    • .. function:: get_code()

    Return Value : returns the code for the breadth_first_search.search() function