This post discusses the logic behind coding a 2 player game of tic tac toe and includes a step by step procedure to make a CUI game, its implementation in Scala, and a link to download a GUI game in Python.
This is an algorithm that is used to traverse a graph Depth-wise. We move forward in depth and visit all the adjacent nodes of a given starting node.
This is also a kind of divide and conquer algorithm where we divide the array into two parts and then call the same function on the two parts and finally merge the sorted halves.
This post discusses the basic cryptographic concept of a brute force attack aimed at guessing a password and includes a python implementation of a brute force attack to gain access to a protected file.
In this sorting algorithm we divide adjacent elements into “bubbles” and repeatedly swap them if they are in the wrong order, until there are no more swaps possible.
Binary search is a search algorithm that cuts down the time taken by linear search by a great amount.In this algorithm, instead of comparing the values of each element, we compare the given value with the middle most element and recursively halve the sorted array.
What is the Fibonacci series? The Fibonacci series is a series of numbers in which each number is the sum of the two preceding numbers. […]