What is 3 Algorithms Per Week?

What are Algorithms?

Google gives us the first result as below when we search the term "Algorithm":


Surely I didn’t understand what it really meant the first time I read this, and yet it is a very important part of our lives, especially for the developers.

Name any company in the IT sector, from Google, Microsoft, Facebook to Infosys and TCS, every one of them asks questions based on algorithms and data structures in their interviews.

Algorithm is nothing but logic or steps to solve a given problem. Be it sorting of numbers in non increasing order or finding the shortest path from your home to your college on Google Maps, algorithms are everywhere.

Why know about Data Structures and Algorithms (DSA)?

So, why do these tech companies emphasise on learning DSA?

In todays fast paced and every growing world speed and space are very important. We want speed to get our google search results quickly, get faster to the destination location and we want space efficiency so that the apps on our phones don’t occupy our mobile memory or manage the BigData that we have. This is where Data structures and Algorithms comes to the rescue.

They give us elegant ways to solve a problem in an efficient manner with more speed and less space. Knowing these Data Structures and Algorithms gives the developer the ability to improve the performance of their application and hence reduce the cost.

If the developer does not know about them then they might not be able to make an efficient solution or might not even be able solve the problem at all.

What is 3 Algorithms Per Week (3APW)?

3APW is a blog where every week I will post about 3 new algorithms, their application, how do they work, their efficiency and finally their code to help you understand them better.

I will also post about the relevant Data Structures which are required for better understanding of the topic including resources which you can refer for further reading or video lectures if required.

The posts will start from the basics and will increase in complexity as time passes.

I will cover topics such as Arrays, Linked Lists, Trees, Graphs, Hash Maps, and all their relevant algorithms. Don’t worry if this is the first time you have heard of these terms, every week you’ll get one step closer to your dream job and improve yourself.

My blog will be at: https://3apw.blogspot.com

You may hit the subscribe button for an email update whenever a new post comes up.

 By,
Anubhav Shrimal

Comments

Post a Comment

Popular posts from this blog

Sorted Array: Binary Search

Image
Binary Search: Binary search is useful when the input array elements are sorted. The algorithm divides the search space into half each time the element to be searched (x) is not found. It uses 3 conditions: 1. If the current element of the array is equal to x, then return the index. 2. Else if the current element of the array is less than x, then x will be present towards the right of the current element (because the array is sorted). 3. Else if the current element of the array is greater than x, then x will be present towards the left of the current element. GeeksForGeeks: Binary Search Example Code in Python 3: # Function for binary search # inputs: sorted array 'arr', key to be searched 'x' # returns: index of the occurrence of x found in arr def binary_search(arr, x): l = 0 r = len(arr) # while the left index marker < right index marker while l < r: # find the index of the middle element mid = int(l + ((r - l...
Keep reading

Segregate Even Odd value nodes in a linked list

Image
Given the head of a singly linked list, segregate even value nodes with odd value nodes such that all the even value nodes come before all the odd value nodes in the order of their appearance. Segregate Even and Odd value nodes Algorithm: Remember the pivot logic we used in QuickSort ? In QuickSort the pivot value was used to separate all the values which are smaller than pivot towards the left of the pivot and all the values greater than pivot value towards the right of the pivot. We will use a similar logic here. 1. Find the first even value node. 2. Bring this node to the start of the linked list. (Call it pivot) 3. Find the next even value node. 4. Insert this node after the pivot and increment pivot one node ahead. 5. Repeat this until we reach Null or None. The algorithm states to bring the first even value node to the start of the linked list and make a pointer pivot point towards it. Whenever we find an even value node, we need to link the previous node to ...
Keep reading