While programming languages are becoming more and more powerful and abstract, knowing about the underlying algorithms and data structures and when and how to use them is still key to writing efficient and elegant programs.

Comparison of Sorting Algorithms

by The Sun God

Comparison of the various sorting algorithms on the basis of several factors

Create ASP.NET Control for Image Resizer and Cropper Keeping Aspect Ratio

by Debashis 10433656

How to create an ASP.NET control for image resizer and cropper keeping aspect ratio

Deep Learning – Training an AI to Play Doom

by Philipp_Engelmann

With recent scientific advancements in Deep Learning, Artificial Intelligence and Neural Networks, as well as steadily evolving tools such as Tensorflow, Pytorch, and Keras, writing, testing and optimizing your own Neural Networks is now easier than ever before.

Density Matrix Renormalization Group

by aroman

In this post I implement a Density Matrix Renormalization Group program.

Dynamic Programming – What, How & When

by Sandeep Mewara

An optimization programming technique

Factory or Simple Factory Design Pattern

by Divya Ulasala

Finding Nearest Colors using Euclidean Distance

by Richard James Moss

How to find the nearest colors using Euclidean distance

Graph is everywhere

by Eric Z (Jing)

The traditional way to solve the ZigZag Conversion problem is to either build a 2d table or find a pattern among the index of the letters on the same row. There is also a beautiful solution which builds on top of Breadth First Search. Continue reading..

How to Solve Word Ladder Problem?

by Sandeep Mewara

A look into graph based algorithm

Implementing Gradient Descent in Go

by Philipp_Engelmann

How to implement Gradient Descent in Go

K-Means Clustering Algorithm

by rtybase

This post is dedicated to K-Means Clustering Algorithm, used for unsupervised learning.

Learn Breadth First Search Graph Traversal with Clone Graph

by IAmJoshChang

Graphs are one of the most common questions that might show up in a technical interview, especially in these days where many real-world applications can be represented by nodes and edges such as the social networks!

Learn Postorder Binary Tree Traversal by Solving Maximum Depth of a Binary Tree

by IAmJoshChang

How to traverse a postorder binary tree

Linear Time Partition – A Three Way Split

by Sandeep Mewara

Linear-time partition: A divide & conquer based selection algorithm

Mapping Shortest Routes Using a Graph Database

by Keyhole Software

We often model interconnected data by cramming it in and out of table structures. Why don’t we simply model interconnected data as … interconnected data?

Priority Queue in C# with the Help of Heap Data Structure

by Alexey Kurakin

This article describes generic priority queue implementation in C#, which uses min-heap as underlying storage.

Python, Min-cost Max-flow, and a Loose End

by Mohammad Nasirifar

My status report while trying to understand why the exact same code Runs 1000s (not kidding) of times slower in Python

Time Complexity 2 – How To Count It

by xszaboj

How to count Time Complexity?

Time Complexity 3 – Asymptotic Notations

by xszaboj

Time complexity – asymptotic notations

Top 5 advices for users of Microsoft Cognitive Services

by Afzaal Ahmad Zeeshan

Introduction and Background As the title suggests, this post is a personal recommendation for the users of Microsoft Cognitive Services, the services that provide a cloud-based subscription-based solution for artificially intelligent software applications, with an any team, any purpose and any scale

What Is CyclicBarrier? Key Facts and Examples Explained

by Trần_Tuấn_Anh

Understanding synchronization in Java is crucial for developing multi-threaded applications. One of the powerful synchronization tools available in Java is the CyclicBarrier. This article delves into what a CyclicBarrier is, how it works, and provides practical examples and demo results.