Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Programming Articles
Page 1875 of 2547
How to sort a slice stable in Golang?
When sorting slices of data in Go, sometimes it's important to maintain the original order of elements that have the same sort key. This is where stable sorting comes into play. A stable sort algorithm ensures that the order of elements with the same sort key remains the same after sorting. Go provides a built-in sort package that includes a stable sorting algorithm. In this article, we will discuss how to sort a slice stably in Go. The sort package in Go provides two functions for sorting slices: sort.Slice() and sort.SliceStable(). The sort.Slice() function sorts a slice of values based ...
Read MoreHow to sort a slice in Golang?
In Go programming language, a slice is a dynamic array that can hold a sequence of elements of the same type. Slices can be sorted using the built-in sort package. In this article, we will discuss how to sort a slice in Golang. Sorting a slice in Go is simple, and there are several ways to accomplish it. The most common way is to use the sort.Slice() function, which sorts a slice using a provided comparison function. Here's how it works − Example package main import ( "fmt" "sort" ) func main() ...
Read MoreHow to Remove Duplicate Values from Slice in Golang?
In Golang, a slice is a dynamically-sized array that can store a collection of elements of the same type. Sometimes, you may need to remove duplicate values from a slice to ensure that each element in the slice is unique. In this article, we'll discuss how to remove duplicate values from a slice in Golang. Method 1: Using a Map One way to remove duplicate values from a slice in Golang is to use a map. Maps are a built-in type in Golang that allow you to store key-value pairs. We can use a map to keep track of the ...
Read MoreHow to Print Specific date-time in Golang?
Go is a programming language that is well-suited for building high-performance, concurrent applications. One of the essential features of any application is the ability to work with date and time. In this article, we will explore how to print specific date-time in Go using the time package. Using the Time Package in Go The time package in Go provides a variety of functions for working with dates, times, and durations. The time.Time type represents a specific moment in time, and we can use its methods to format dates and times according to a specific layout. To print a specific date-time ...
Read MoreSwift Extract Regex Matches
In Swift, you can extract regex matches using the NSRegularExpression class provided by the Foundation framework. Swift's NSRegularExpression is a powerful tool for working with regular expressions in Swift. It can be used for a wide range of text-processing tasks. NSRegularExpression Class You can make use of regular expressions with the Swift Foundation framework class called NSRegularExpression. With the help of regular expressions, you may search and replace text as well as create patterns that define collections of strings. You can use NSRegularExpression to convert a string pattern into a regular expression object, which you can then use to find ...
Read MoreHaskell Program To Find The Perfect Number
In haskell we can use list comprehension and brute-force method to find the perfect number. What is a Perfect Number? Perfect numbers are positive integers that are equal to the sum of their proper divisors. A divisor of a positive integer n is a positive integer that divides n exactly, leaving no remainder. A proper divisor is a divisor of n that is less than n itself. For example, the proper divisors of 6 are 1, 2, and 3, and the sum of these divisors is 1 + 2 + 3 = 6. Therefore, 6 is a perfect number.. Algorithm ...
Read MoreHaskell Program to Check Whether a Number is Prime or Not
To check whether a given number is prime or not we are going to use mod function and list comprehension method in Haskell. What is a Prime Number? A prime number is a positive integer greater than 1 that is only divisible by 1 and itself. In other words, a prime number cannot be written as the product of two smaller positive integers, except for 1 and itself. For example, the first few prime numbers are: 2, 3, 5, 7, 11, 13, 17, 19, 23, and 29. Algorithm Step 1 − The isPrime function is defined. Step 2 ...
Read MoreHaskell Program to Check if two strings are anagram
In Haskell we can check if given two strings are anagram or not using sort function and freqMap. What is Anagram? An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. For example, the word "listen" is an anagram of the word "silent". Anagrams are often used in word play, puzzles, and other forms of entertainment. Algorithm Step 1 − The Data.List module is imported to use sort function. Step 2 − The isAnagram function using sort function is defined Step 3 ...
Read MoreHaskell Program to Check Palindrome
This tutorial will help us in checking if any number is palindrome number or not using user-defined function and boolean functions in haskell. A palindrome number is a number that remains the same when its digits are reversed. The following example will give you a clear idea about Palindrome number. For example, 121, 12321, and 1221 are palindrome numbers, while 123, 1234, and 1212 are not. Algorithm Step 1 − The isPalindrome function using reverse function is defined as, isPalindrome str = str == reverse str. Step 2 − Program execution will be started from main function. The ...
Read MoreHaskell Program to create Complex numbers from given imaginary parts
In this article we are going to use the internal function of Haskell like Data.complex and Prelude to create a complex number from a given imaginary parts. This tutorial will help us in creating the complex number from the given imaginary part. The imaginary part of a complex number is the coefficient of the imaginary unit, typically represented by the symbol "i", in the standard form of the complex number. A complex number can be represented in standard form as a + bi, where a is the real part and b is the imaginary part. Algorithm Step 1 − ...
Read More