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
Articles by Akhil Sharma
Page 21 of 51
Haskell Program to Convert String to an Array
In Haskell, we will convert String to an Array by using listArray and intersperse functions. In the first example, we are going to use (stringToArray s = listArray (0, length s - 1) s) function and in the second example, we are going to use (stringToArray s = s) function. In the third example, we are going to use (stringToArray s = intersperse ' ' s). Algorithm Step 1 − The stringToArray function is defined Step 2 − The program execution will be started from main function. The main() function has whole control of the program. It is written ...
Read MoreHaskell Program to Convert Character to String
In Haskell, we can convert Character to String by using user-defined function, show function, list comprehension and (:[]) notation. In the first example, we are going to use (charToString c = [c]) function and in the second example, we are going to use (charToString c = show c) function. Where as in third, we are going to use (charToString c = [x | x String charToString c = [c] main :: IO () main = do let myChar = 'a' let myString = charToString myChar putStrLn myString Output [1 of 1] ...
Read MoreHaskell Program to Check Whether an Alphabet is Vowel or Consonant
We can use elem function in Haskell to check whether the given alphabet is vowel or consonant. In the first example, we are going to use (isVowel c = c `elem` "aeiouAEIOU") function. And in other examples, we’re going to use elem function along with certain if-else statements, nested conditions and guards. Algorithm Step 1 − The data type ‘Person’ is defined with two fields name and an age. Step 2 − The isVowel function is defined using elem function as Step 3 − The program execution will be started from main function. The main() function has whole control ...
Read MoreHaskell Program to Call One Constructor from Another
In Haskell, we will call one constructor from another by using user-defined function. In the first example, we are going to use (newPerson name = Person name 10) constructor and in the second example, we are going to use (newPerson n a = Person { name = n, age = a }) constructor. In the third example, we are going to use (clonePerson p = p { name = name p ++ " clone" }) constructor and in the fourth example, we are going to use (clonePerson p = p { name = name p ++ " clone" }) ...
Read MoreHaskell Program to get total Bits Required for the Given Number using Library Function
Haskell has internal function like finiteBitSize, ceiling, logBase, length and showIntAtBase that can be used to get total bits required from the given number. In the first example, we are going to use (bits = finiteBitSize (fromIntegral x :: Int)) function and in the second example, we are going to use (bitsRequired n = ceiling (logBase 2 (fromIntegral (abs n) + 1))) function. In the third example, we are going to use (bitsRequired n = length $ showIntAtBase 2 intToDigit (abs n) "") function. Algorithm Step 1 − Import the internal libraries Step 2 − The bitsRequired function ...
Read MoreHaskell Program to Calculate the Logarithm Gamma of the Given Number
In Haskell, we will calculate the logarithm gamma of the given number by using Stirling’s approximation and Lanczos appromixation formula. In the first example, we are going to use Stirling’s approximation with (s = foldr (\(c, q) acc -> c + (q / (x + acc))) 0 (zip (tail p) q) in (log s) - t + log (sqrt (2 * pi) / x) + (c * log (1 + c / 12.0 - (c * c) / 360.0)) function and in the second example, we are going to use Lanczos approximation formula along with (lanczos = log $ ...
Read MoreHaskell Program to Round a Number to n Decimal Places
In Haskell, we can use round, printf and truncate functions to round a number to n decimal places. In the first example, we are going to use (roundTo n x = (fromInteger $ round $ x * (10^n)) / (10.0^^n)) function and in the second example, we are going to use (roundTo n x = read $ printf ("%." ++ show n ++ "f") x) function.In the third example, we are going to use (roundTo n x = fromIntegral (truncate $ x * 10^n) / 10^n). Algorithm Step 1 − The roundTo function is defined using round function Step ...
Read MoreGolang program to get key based on value from the hash collection
In golang, we can use hashmap to perform various operations like deleting, updating, and storing the values in the hash collection. In this article, we are going to understand get key based on a value from the hash collection using two different examples. In the first example, we will use an external function and iterate the map to get the key from the value, in the second example we will use a reverse map to get the key from the desired value. Algorithm Create a package main and declare fmt(format package) in the program where main produces executable codes ...
Read MoreHaskell Program to Find the Product of Two Numbers Using Recursion
In Haskell, we can find the Product of Two Numbers by using recursion along with recursive repeated addition. In the first example we are going to use (product' x y | y == 0 = 0 | y == 1 = x | otherwise = x + product' x (y-1)) function. And in the second example, we are going to use recursive repeated addition. Algorithm Step 1 − The recursive product’ function is defined as, For example 1 and 2 − product' x y | y == 0 = 0 ...
Read MoreHaskell Program to Find Sum of Digits of a Number using Recursion
In Haskell, we can find Sum of Digits of a Number by using recursion along with mod, div and other helper functions. getCurrentTime and NominalDiffTime function. In the first example we are going to use (sumOfDigits n | n < 10 = n | otherwise = (n `mod` 10) + sumOfDigits (n `div` 10)) function. And in the second example, we are going to use helper function. Algorithm Step 1 − The recursive sumOfDigits function is defined as, For example 1 − sumOfDigits n | n < 10 = n ...
Read More