Algorithms

Algorithms

Space Time Complexity [Computer Science]

In this article at OpenGenus, we have covered the concept of Space Time Complexity in depth which is a must in Algorithmic Analysis.

Algorithms

Mario less and Mario more - CS50 Exercise

In this article at OpenGenus, we have solved the Mario less and Mario more problem in CS50. This involves printing a pattern.

Java

Linear Search in Java [both Array + Linked List]

In this article at OpenGenus, we will be implementing linear search algorithm for both arrays and linked list in Java.

Algorithms

Find Duplicate File in System [Solved with hashmap]

In this article at OpenGenus, we will learn to how to solve the problem "Find duplicate files in the system" using string stream and hashmap.

Linear Search

Linear Search in R [single-thread + multi-thread]

If you are confused how to implement Linear Search in R, this article at OpenGenus will help you. We have provided both single-threaded and multi-threaded implementation in R for Linear Search.

Algorithms

Range greatest common divisor (GCD) query using Sparse table

In this article at OpenGenus, we will be discussing one of the common problem in computer science that involves finding the GCD of a given range of numbers in an array. One of the efficient solution is to use sparse table data structure to solve this problem.

Linear Search

Advantages and Disadvantages of Linear Search

In this article at OpenGenus, we have explained 7 Advantages and 5 Disadvantages of Linear Search. This will give you a core insight about Linear Search.

C Programming

Selection sort in C

In this article, we have explained how selection sort and implement a program on the same in C Programming Language.

C Programming

Merge Sort in C

In this article at OpenGenus, we have explained merge sort and implemented a program on the same in C Programming Language.

Algorithms

My Calendar III Problem [Solved with Segment Tree, Sweep Line]

In this article at OpenGenus, we have solved the Calendar 3 problem that is to find number of conflicting meetings in a given range of time. We have solved this using the concept of Sweep Line and Segment tree with Lazy Propagation.

Algorithms

Bubble sort in C

In this article, we have explained bubble sort algorithm and implemented a program on it in C Programming Language.

Algorithms

Binary Search in C using recursion

In this article at OpenGenus, we have explained Binary search algorithm and implement a program on the same in C programming language using recursion.

Algorithms

Linear Search explained simply [+ code in C]

In this article, we have explained Linear search algorithm and implement a program on the same in C programming language.

Algorithms

Minimum cost to connect all points (using MST)

In this article, we will understand how to solve the minimum cost to connect all the points problem using Minimum Spanning Tree.

C++

QuickSort using template in C++

In this article, we have designed and implemented Quick Sort algorithm in C++ Programming Language to use the concept of template to make Quick Sort generic/ independent of input datatype.

Search Algorithms

OOP design for Search Algorithms

In this article, we have presented good implementation designs considering there are multiple search algorithms and different data types.

backtracking

Shortest path in a Maze using Backtracking

In this article, we have covered the topic on finding the Shortest path in a Maze using Backtracking. We have presented the Time and Space Complexity for various cases.

C Programming

C program to swap two numbers without using third variable [3 techniques]

In this article, we have demonstrated multiple approaches to swap two numbers without using a third temporary variable.

Algorithms

Schedule Events in Calendar Problem [Segment Tree]

In this article, we will discuss the My Calendar 1 problem where we need to schedule events in a calendar such that there is no conflict. This will involve the concept of Segment Tree.

C++

Parallel Radix Sort handling positive & negative numbers in C++

In this article, we have designed and implemented Parallel Radix Sort handling positive and negative numbers in C++ Programming Language.

Algorithms

Minimum Deletions to Make Array Divisible [3 Solutions]

In this article, we will explore how we can get the minimum number of deletion of smallest element such that the smallest element in the first array divides all the elements in the second array. This will involve the concept of Min Heap and Hash Map.

Algorithms

Find K closest numbers to a given value

In this article, we will explore on how to find the K closest numbers to a given value in a given set of numbers. We have presented two approaches using the concepts of binary search and Heap data structure.

Python

Multi-threaded Python code to find Prime Numbers using Sieve of Eratosthenes

In this article, we have designed and implemented a Multi-threaded Python code to find Prime Numbers using Sieve of Eratosthenes.

binary search

K-th Smallest Number in Multiplication Table [Solved]

In this article, we have solved the problem of finding the K-th Smallest Number in Multiplication Table. This involve the concept of Binary Search.

Algorithms

Find K-th Smallest Pair Distance [Solved]

In this article, we have solved the problem of finding the K-th smallest pair distance. This involve the concept of Binary Search.