eduAlgo 1.0.3

An educational Algorithmic Library

eduAlgo

    

   

Objective

A python package published at PyPi. The project can be viewed here - PyPi - eduAlgo.

Aim Of The Package

This is a very simple python package made with python script to study different algorithms for educational purposes. This package is under planning version and aims to achieve the following,

• Contain All the available algorithms
• Help students with learning space and time complexity
• Visualizing Algorithms
• Getting resources, articles etc to study about python and Algorithms
• Become a handy tool for the programmers while using different algorithms on daily basis

Current Algorithms

• Bubble sort
• Selection sort

Algorithms Yet to Publish

• Searching Algorithms and Visualizations
• Sorting Algorithms and Visualizations
• Graph Algorithms and Visualizations
• Linked List Implementations and Vizualizations
• Tree Types, Vizualizations and Implementations

Ongoing Issues

Here is a list of algorithmic implementations using a linked list -

Issue#1

Can be viewed here

• Palindromic Linked List -
• Remove Linked List Elements -
• Intersection Of Two Linked List -
• Linked List Cycle -
• Remove Duplicates From a Sorter List -
• Merge Two Sorted List -
• Reverse Linked List -
• Delete Node In a Linked List -
• Middle Of the Linked List -
• Delete M Modes after M Nodes of a Linked List -
• Convert Binary Number In a Linked List to integer -

issue#2

Can be viewed here

• Design Linked List -
• Rotate List -
• Insert Into a Sorted Circular Linked List -
• Add Two Numbers -
• Remove Nth Node From End of List -
• Copy List with Random Pointer -
• Remove Duplicates From The Sorted List (Second Version) -
• Reorder List -
• Linked List Cycle (Second Version) -
• Reverse Linked List (Second Version) -
• Linked List In Binary Tree -
• Insertion Sort List -
• Remove Zero-Sum Consecutive Nodes from Linked List -
• Partition List -
• Sort List -
• Design Phone Directory -
• Convert Sorted List to Binary Search Tree -
• Swap Nodes in Pairs -
• Split Linked List in Parts -
• Add Two Numbers(Second Version) -
• Flatten a Multilevel Doubly Linked List -
• Odd-Even Linked List -
• Linked List Components -
• Next Greater Node in Linked List -
• Plus One Linked List -
• Convert Binary Search Tree to Sorted Doubly Linked List -

Issue#3

Can be viewed here

• Reverse Nodes in k-Group -
• Merge k Sorted Lists -

The addition of code for these implementations is ongoing.

Installation

Fast install:

pip install eduAlgo

Example

    from edualgo import algorithm.sort

    arr = [5,4,3,2,1]
    obj = sort()
    sorted_arr = obj.bubble_sort(arr)
    print(sorted_arr)

Here is the output:

   [1,2,3,4,5]

License

This package is under MIT License copyright @Abhijit Tripathy