I will do tasks and projects of design and analysis of algorithms

You want efficient solutions to solve algorithmic problems in your project? I create algorithms according to specific project requirements and execute their implementation and analysis work. I provide solutions for efficiency improvements as well as time and space complexity optimization and complex problem resolution.

3+ Years Experience

What I Offer:

• Algorithm design & analysis, Data Structures
• Implementation in Java, Python, and more
• Complexity analysis (time & space)
• Problem solving & debugging

ALGORITHMS:

• Kruskal's Algorithm
• Bellmen Ford Algorithm
• Floyd Warshall
• Prim's Algorithm
• Dijkstra Algorithm
• Binary, Linear Search Algorithm
• Greedy Algorithm
• Divide and Conquer Algorithm
• Huffman Code Algorithm
• Ford Fulkerson Algorithm
• Shortest Job First (SJF)
• Breadth First Search (BFS)
• Depth First Search (DFS)
• Merge, Quick Sort Algorithm
• Bubble Sort Algorithm
• Insertion Sort Algorithm
• Time Complexity
• Space Complexity
• Big O Notation
• Knapsack Problem
• Dynamic Programming
• Min-Max Problem
• N Queens Problem
• Travel Salesman Problem
• Binary Search Tree
• Minimum Spanning Trees
• AVL Tree
• Segment Tree
• Recursion Tree

and much more

Available for any queries - Your Satisfaction is my priority.