Graph is a non-linear data structure like tree data structure. A Graph is composed of a set of vertices(V) and a set of edges(E). The vertices are connected with each other through edges.

Greedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution.

A Binary search tree is a binary tree where the values of the left sub-tree are less than the root node and the values of the right sub-tree are greater than the value of the root node. In this art...

Practice for sort-algorithms

Practice for Binary Search Tree

Practice for sort-algorithms

In the House Price Prediction project, the Data Understanding phase focuses on exploring, cleaning, and preparing raw data to ensure it is suitable for modeling. The first step is data cleaning, wh...

This chapter introduces the Python programming language, focusing on basic data types and operators. It explains how the Python interpreter works, how variables and objects are created, and the dif...

This chapter introduces the Python programming language, focusing on basic data types and operators. It explains how the Python interpreter works, how variables and objects are created, and the dif...

Analytic Approach from bussiness understanding to Analysis design software.