Skip to the content

coderz.py

Keep Coding Keep Cheering!

  • General
  • Data Structure
  • Web Dev
  • AI
    • Machine Learning
    • Deep learning
  • Privacy Policy
  • General
  • Data Structure
  • Web Dev
  • AI
    • Machine Learning
    • Deep learning
  • Privacy Policy
  • General
  • Data Structure
  • Web Dev
  • AI
    • Machine Learning
    • Deep learning
  • Privacy Policy
Linear Search

Linear Search or Sequential Search in Python

  • December 19, 2020
  • Algorithm / python
sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.
Hash Table

Implementation of a Hash Table in Python

  • December 19, 2020
  • Algorithm / python
The idea of a dictionary used as a hash table to get and retrieve items using keys is often referred to as a mapping. Python already has a built-in dictionary object that serves as a Hash Table.
Shell Sort

Implementation of Shell Sort in Python

  • December 19, 2020
  • Algorithm / python
The shell sort improves on the insertion sort by breaking the original list into a number of smaller sub-lists, each of which is sorted using an insertion sort.
Selection Sort

Implementation of Selection Sort in Python

  • December 17, 2020
  • Algorithm / python
The selection sort improves on the bubble sort by making only one exchange for every pass through the list.
Quick Sort

Implementation of Quick Sort in Python

  • December 15, 2020
  • Algorithm / python
A quick sort first selects a value, which is called the pivot value. Although there are many different ways to choose the pivot value, we will simply use the first item in the list.
Merge Sort

Implementation of Merge Sort in Python

  • December 15, 2020
  • Algorithm / python
Merge sort is a recursive algorithm that continually splits a list in half. If the list is empty or has one item, it is sorted by definition (the base case)
Insertion Sort

Implementation of Insertion Sort in Python

  • December 15, 2020
  • Algorithm / python
Insertion Sort builds the final sorted array (or list) one item at a time.
Bubble Sort

Implementation of a Bubble Sort in Python

  • December 13, 2020
  • Algorithm / python
The bubble sort makes multiple passes through a list. It compares adjacent items and exchanges those that are out of order. Each pass through the list places the next largest value in its proper place. In essence, each item “bubbles” up to the location where it belongs.
Binary Search

Implementation of Binary Search in Python

  • November 21, 2020
  • Algorithm / python
Binary Search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array.
Coin Change

Coin Change Problem in Python

  • November 18, 2020
  • Algorithm / python
Given a target amount n and a list (array) of distinct coin values, what's the fewest coins needed to make the change amount.

Posts navigation

Page Number1 Page Number2 … Page Number5

Advertisement

Codecademy Web Development
Kobo U.S

Recent Posts

  • Linear Search or Sequential Search in Python
  • Implementation of a Hash Table in Python
  • Implementation of Shell Sort in Python
  • Implementation of Selection Sort in Python
  • Implementation of Quick Sort in Python
Copyright : coderz.py