Jayant Verma

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…

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…

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…

Trie data structure is very efficient when it comes to information retrieval. It is majorly used in the implementation of dictionaries and phonebooks. It is also useful for implementing auto-text suggestions you see while typing on a keyboard. In this…

NaN is short for Not a number. It is used to represent entries that are undefined. It is also used for representing missing values in a dataset. The concept of NaN existed even before Python was created. IEEE Standard for…

Interpolation is a technique in Python with which you can estimate unknown data points between two known data points. It is commonly used to fill missing values in a table or a dataset using the already known values. Interpolation is…

PDFs are a common way to share text. PDF stands for Portable Document Format and uses the .pdf file extension. It was created in the early 1990s by Adobe Systems. Reading PDF documents using python can help you automate a…