What is Dijkstra’s Algorithm Dijkstra’s algorithm is used to determine the shortest path or shortest distance between two nodes in a given graph, Dijkstra’s algorithm comes under the category of pathfinding algorithms and these algorithms are highly used in data transmission over the networks. If I try to make it simple, the page you are […]
k-means is one of the most widely used Clustering algorithm existing right now, in the algorithm k is a variable which we need to provide and algorithm will divide a given n number of observations into k number of clusters, logic of assigning a cluster to a particular observation is based on the distance between the observation […]
Recently one of my friend who just passed out of the university went to an interview and there the interviewer asked him to write an sorting algorithm without using array length as well as without using for or while loops. Here is the algorithm I came up, there can be various ways you can solve […]
