Jayant Verma

$ echo "This is Jayant and he loves Linux," $ echo "He writes tutorials that help you understand Linux better." $ echo "He thinks that the commands 'awk' and 'sed' sound funny." $ echo "Do you want to learn Linux?" $ read answer (and my articles :P )

Latest Posts From Jayant Verma

Conversion Between Miles And Km

Convert Kilometers to Miles using Python

It’s easy to convert kilometers to miles or miles to kilometers in Python. The kilometer is the unit of length in the metric system. However, sometimes length is also expressed in miles. Converting from one….
Compare Two Files

Compare two files in Linux – Using diff, vimdiff, and colordiff

Linux provides you with multiple options to compare two files. The most popular command to compare two files is diff. In this tutorial we will look at diff command and some other options the you….
Vi Vs Vim

Vim vs Vi – Similarities and Differences Between VIM and VI?

Vim and Vi are both text editors available in Linux. Vi stands for Visual since it is a visual editor. Vim is short for Vi Improved. The two editors are very similar to each other…..
Max Heap in Java

Max Heap Data Structure Implementation in Java

A max heap is a complete binary tree in which the value of a node is greater than or equal to the values of its children. Max Heap data structure is useful for sorting data….
Heapsort

HeapSort implementation in Java/C++

Heapsort is a sorting algorithm that uses Binary heaps for the purpose of sorting. Heaps can be of two types, min-heap and max heap. Heapsort is an improved version of selection sort. For this tutorial….
Kadane's Algorithm

Kadane’s Algorithm to solve Maximum Subarray Problem

Maximum Subarray Problem is a famous problem in dynamic programming. The algorithm we use to solve this problem is known as Kadane’s algorithm. It is a slightly tricky algorithm to understand but don’t you worry…..

Breadth-First Search (BFS) and Depth-First Search (DFS) for Binary Trees in Java

Breadth-First Search and Depth-First Search are two techniques of traversing graphs and trees. In this tutorial, we will focus mainly on BFS and DFS traversals in trees. What is Depth First Search (DFS)? The algorithm….

Tower of Hanoi – Algorithm and Implementation in Java

The Tower of Hanoi is a classic problem in the world of programming. The problem setup consists of three rods/pegs and n disks. The disks can be moved from one peg to another. The n….
ADJACENCY LIST

Adjacency List – Theory and Implementation in Java/C++

In this article, we’re talking about an adjacency list. A graph is a collection of edges and vertices. It is a convenient way of representing a network of nodes. There are multiple ways to represent….
N Queen Problem Using Backtracking

N-Queens problem using backtracking in Java/C++

If you love playing chess, you’ll enjoy learning about the N-queens problem. It is a good problem to understand backtracking. What is Backtracking? In backtracking, we start with one pos­si­ble move out of many avail­able….

close
Generic selectors
Exact matches only
Search in title
Search in content
Search in posts
Search in pages