Latest Posts From Jayant Verma

Treemap Python

How to Plot a Treemap in Python?

A treemap in Python is a visualization of data that splits a rectangle into sub-parts. The size of each subpart is in proportion to the data it represents. It is somewhat like a pie-chart. Although, treemaps can represent much-more complex data as compared to a pie-chart. It can help you visualize how single values compose […]

Npy Files

How to Save in .npy Format?

Ever come across a .npy file? In this article, we’ll go over the steps to save in npy format. NPY is Numpy’s binary data storage format. Numpy is an essential module for carrying out data science operations efficiently. Importing, saving and processing of data takes up a major portion of the time in the field […]

Quicksort

How to Implement QuickSort in Python?

Quicksort is a sorting algorithm that follows the policy of divide and conquer. It works on the concept of choosing a pivot element and then arranging elements around the pivot by performing swaps. It recursively repeats this process until the array is sorted. In this tutorial we will learn how QuickSort works and how to […]

Inf

Infinity in Python – Set a Python Variable Value to Infinity

A simple number cannot represent your dataset? How about setting your variable value to infinity in Python? Today we’re talking about just that! While coding in Python, we often need to initialize a variable with a large positive or large negative value. This is very common when comparing variables to calculate the minimum or maximum […]

Pie Chart

How to Plot and Customize a Pie Chart in Python?

A pie chart is a circular statistical graphic, which is divided into slices to illustrate numerical proportions. In a pie chart, the arc length of each slice is proportional to the quantity it represents. Pie charts are a popular way to represent the results of polls. In this tutorial, we will learn how to plot […]

0:1 Knapsack

Solving 0/1 Knapsack Using Dynamic programming in Python

In this article, we’ll solve the 0/1 Knapsack problem using dynamic programming. Dynamic Programming is an algorithmic technique for solving an optimization problem by breaking it down into simpler subproblems and utilizing the fact that the optimal solution to the overall problem depends upon the optimal solution to its subproblems. 0/1 Knapsack is perhaps the […]