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
Haskell Articles
Page 13 of 13
Haskell program to calculate the sum of natural numbers
In this tutorial, we discuss writing a program to calculate the sum of the natural numbers in the Haskell programming language. Natural numbers are positive integers starting from 1, 2, 3...N In this tutorial, we see different ways to implement a program to compute the sum of natural numbers. Program to compute the sum of the natural numbers using a mathematical formula. Program to compute the sum of the natural numbers using a recursive function. Program to compute the sum of the natural numbers using the list method/function sum. Algorithm steps Declare or take input the range ...
Read MoreHaskell Program to Calculate simple interest and compound interest
In this tutorial, we discuss writing a program to calculate simple and compound interest in the Haskell programming language In this tutorial, we see Program to compute Simple interest. Program to compute Compound interest. Simple interest is an Interest method for an investment, where interest is defined as I = p*t*r/100, where p is the invested amount, t is the quantity of time in years, and r is the interest rate. (per 100). Example − For an invested amount of 1000(p), t= 2 and r =3 the interest is 60. Compound interest is an Interest method for an ...
Read MoreHaskell program to get input from the user
In this tutorial, we discuss writing a program to get input from the user in the Haskell programming language. Haskell is a Declarative, Strongly Typed, and Functional programming language. Computations in Haskell are mathematical functions. In this tutorial, we discuss two ways to get input from the user in Haskell. User input using the getLine method. User input using the getChar method. As Haskell is a purely functional Language. Pure functions are the functions that return the same output for the same arguments. Taking user input changes the program’s nature to impure. Haskell introduced a type IO that ...
Read MoreHaskell program to add two complex numbers
This tutorial will discuss writing a program to add two complex numbers in the Haskell Programming Language. Haskell is a declarative, strongly typed, and functional programming language. The computations in Haskell are mathematical functions. Complex numbers are a combination of real and imaginary values. Example: 1 + 2i, where i is √-1 In this tutorial, we see four ways to Add two complex numbers. Computing the addition using the infix operator for addition “+”. Implementing addition computation in a separate function. Computing the addition using the infix operator “+” as a function. Computing the addition of complex numbers by ...
Read MoreHaskell program to display alphabets (A-Z) using a loop
This tutorial will discuss writing a program to display characters from A-Z in Haskell programming Language. Haskell is a Functional, Declarative, and Strongly Typed Language. The computations in Haskell are mathematical functions. In this tutorial, We see two ways to display Alphabets in Haskell. An iterative Program to display Alphabets. A recursive Program to display Alphabets. Note − Haskell doesn’t support Loops, So we mimic the function of a loop with other iterative and recursive implementations. Algorithmic Steps Implement the logic for printing Alphabets. Print/display Alphabets. Displaying Alphabets In An Iterative Way Using List Comprehensions. Example Program ...
Read MoreHaskell program to find the gcd of two numbers
This tutorial will discuss writing a program to find the LCM of two numbers in the Haskell Programming Language. Haskell is a functional programming language. The GCD of two numbers is the Greatest Common Divisor/ Number that divides both numbers Can also be called as Highest Common Factor. In this tutorial, we discuss five ways to implement a program to find the GCD of two numbers. Using the inbuilt function gcd. Using the inbuilt function lcm. Computing GCD using list comprehension. Computing GCD using a recursive function with three arguments. Computing GCD using a recursive function with two arguments. ...
Read MoreHaskell program to find lcm of two numbers
This tutorial will discuss writing a program to find the LCM of two numbers in the Haskell Programming Language. Haskell is a functional programming language. LCM of two numbers is the least common multiple for that two numbers i.e smallest number that is divided by both numbers. In this tutorial, we discuss five different ways to implement a program to find the LCM of two numbers. Using inbuilt function lcm. Computing LCM using list comprehension. Computing LCM using a recursive function. Computing LCM using the HCF (Highest Common Factor) function. Algorithm steps Take the two integers as ...
Read MoreHaskell program to add binary strings
This tutorial will discuss writing a program to add binary Strings in Haskell Programming Language. The computations in Haskell are Mathematical functions. Binary Strings represent a number in binary form but with String data type. Example: 5 is described as “0101”. Algorithmic steps Take Binary Strings as input. Implement the logic for adding binary Strings Print the resultant Binary String. Program to add Binary Strings We break the program into simpler functions Syntax Importing essential Packages/Modules import Data.Char Data.Char is a useful module for having functions to type cast Character to Integer and Integer to ...
Read MoreHaskell program to display all prime numbers from 1 to n
This tutorial will discuss writing a program to display all prime numbers from 1 to N in Haskell Programming Language. Haskell is a declarative, strongly typed, and functional language. The computations in Haskell are mathematical functions. A prime number is one that must have two positive factors 1 and the number itself. Example 2, 3, 5, 7, .. Note 1 is not a prime number because it has only one factor. Algorithm steps Implementing a function to check whether a number is prime. Implementing a function to generate all prime in a range. Display the prime numbers. Program to ...
Read MoreHaskell Program to Check whether the input number is a Neon Number
This tutorial will discuss writing a program to check whether the input number is a Neon Number in Haskell Programming Language. The computations in Haskell are mathematical functions. A neon Number is a number that satisfies the property: number is equal to the sum of the digits of its square. Example: 9 is a neon number because the sum of the digits of its square “81” (8+1) is equal to the number 9. In this Tutorial, we will discuss Program to check whether the number is a Neon number. Program to print neon numbers in a range in an ...
Read More