algorithms Archives - onlinetutorialspoint

Moore’s Voting Algorithm | Majority element in an array

Swathi — Thu, 22 Apr 2021 13:19:06 +0000

In this tutorial, we'll learn about Moore's voting algorithm in Python. To understand this, let's start with the problem of finding the majority element in a given array. Majority element problem Say, you're given an array A of size n. Now, the element in the array, that appears more than n/2 times is said to

The post Moore’s Voting Algorithm | Majority element in an array appeared first on onlinetutorialspoint.

Kadane’s Algorithm | Maximum subarray sum

Swathi — Sun, 07 Mar 2021 14:22:59 +0000

In this tutorial, we will see how to solve the maximum sub array sum problem efficiently using the Kadane's Algorithm. Maximum subarray sum What is the maximum subarray sum problem? Say, you're given an array of integers, of size n, and you're asked to find the contiguous sub array with maximum sum, how will you

The post Kadane’s Algorithm | Maximum subarray sum appeared first on onlinetutorialspoint.

How to implement Counting Sort Algorithm Python

Swathi — Mon, 04 Jan 2021 14:19:18 +0000

In this tutorial, we'll learn about counting sort algorithm in Python. Counting sort is a stable sorting algorithm, which uses the frequencies of each element in the array to sort the given array in linear time. However, it is efficient only when the range of the input data is not much greater than the number

The post How to implement Counting Sort Algorithm Python appeared first on onlinetutorialspoint.

Sieve of Eratosthenes – Finding prime numbers less than a given number

Swathi — Mon, 28 Dec 2020 05:08:36 +0000

In this tutorial, we will see how to find all the prime numbers less than a given number using Sieve of Eratosthenes algorithm. Sieve of Eratosthenes is the most classic and efficient algorithms to find all the prime numbers up to a given limit. Say, you're given a number 'n' and you're asked to find

The post Sieve of Eratosthenes – Finding prime numbers less than a given number appeared first on onlinetutorialspoint.

Python – Three way partitioning of an Array Example

Swathi — Thu, 24 Dec 2020 05:22:19 +0000

In this tutorial, we will see how to do three way partitioning of an array around a given range. What is Three way partitioning? Given an array, and a range, say, [A,B], the task is to partition the array into three parts such that, All the elements of the array that are less than A

The post Python – Three way partitioning of an Array Example appeared first on onlinetutorialspoint.