×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner
Harshul Nanda

Harshul Nanda

11 posts •
recursion

Print all combinations of factors

In this article, we will discuss about the algorithms to print every combination of factors of a given number (all factorization). We have explored recursive and partially iterative approach.

Harshul Nanda Harshul Nanda
Algorithms

Divide and Conquer

In this article, we will discuss what is Divide and Conquer technique and how is it helpful. We will see various examples which uses the Divide and Conquer approach in their algorithms.

Harshul Nanda Harshul Nanda
Decrease & Conquer

Decrease and Conquer

In this article, we will discuss about the technique Decrease and Conquer which is similar to Divide and Conquer. Decrease and Conquer can be used to solve several important problems such as Fake Coin Problem, Generating Subsets and much more.

Harshul Nanda Harshul Nanda
game theory

Pure and Mixed Strategy Nash equilibrium

In this article, we will discuss about the pure and mixed strategy nash equilibrium which are important concepts in Game Theory.

Harshul Nanda Harshul Nanda
Problems on Binary Tree

Check if binary tree is symmetrical

In this article, we will discuss the algorithms to find out whether the given binary tree is symmetrical or non-symmetrical.

Harshul Nanda Harshul Nanda
Algorithms

Double Hashing

In this article, we will discuss about Double Hashing, a technique to resolve hash collisions in hash tables along with Time Complexity analysis of Double Hashing.

Harshul Nanda Harshul Nanda
Algorithms

Quadratic Probing

In this article, we will discuss about quadratic probing, a solution for hash collisions in hash tables.

Harshul Nanda Harshul Nanda
Sorting Algorithms

Different Hybrid Sorting Algorithms

In this article, we will discuss about various Hybrid sorting algorithms such as Tim Sort Algorithm. Hybrid Sorting Algorithms tend to perform better than pure Sorting Algorithms and hence, are widely used in practice.

Harshul Nanda Harshul Nanda
Algorithms

Intro Sort

In this article, we will discuss about the Introspective or Intro sort algorithm which is an efficient Hybrid Sorting Algorithm making use of Quick Sort, Heap Sort and Insertion Sort.

Harshul Nanda Harshul Nanda
Time Complexity

Time and Space Complexity of Comb Sort

In this article, we will learn about Time Complexity and Space Complexity of Comb Sort algorithm, with the in-depth mathematical analysis of different cases. Comb Sort is also known as Dobosiewicz Sort.

Harshul Nanda Harshul Nanda
List of Mathematical Algorithms

Different ways to calculate nᵗʰ Fibonacci number

In this article, we will implement different algorithms to calculate n-th Fibonacci number.

Harshul Nanda Harshul Nanda
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship