Basics of Operators very helpful in programming

Operators are symbols that tell the compiler to perform specific mathematical or logical manipulations. In this tutorial , we will try to cover the most commonly used operators in programming. First, let’s categorize them: 1. Arithmetic 2. Relational 3. Bitwise 4. Logical 5. Assignment 6. Increment 7. Miscellaneous Arithmetic Operators:   Symbol Operation Usage Explanation […]

which language is best for competitive programming?

In Brief :- Best language for competitive programming :- Language plays little role in competitive programming. It is the competitor who needs to think and create algorithms. Well many people use C++ and java for programming. People use Python too because of its available functions, but that all things can be done in C++ too. […]

Insertion Sort Algorithm

This is an in-place comparison-based sorting algorithm. Here, a sub-list is maintained which is always sorted. For example, the lower part of an array is maintained to be sorted. An element which is to be ‘insert’ed in this sorted sub-list, has to find its appropriate place and then it has to be inserted there. Hence […]

Sorting Algorithim

Sorting Algorithms :- Definition  In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimising the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonicalizing data and for producing human-readable output. examples of sorting […]

Breadth First Search example (BFS) – How GPS navigation works

Breadth First Search example:- There are differences in the route which I usually take and the one which GPS shows as the shortest, probably due to the algorithms used. I learned from my graph theory data structure classes that (BFS) Breadth First search example is GPS navigation and digital maps. I tried looking for the […]

Kruskal’s algorithm (Minimum spinning tree) with real life example

Kruskal’s algorithm (Minimum spinning tree) with real life example:- Most of the cable network companies use the Disjoint Set Union data structure in Kruskal’s algorithm to find the shortest path to lay cables across a city or group of cities. Which leads us to this post on the properties of Disjoint sets union and minimum spanning […]