/*Java program to find out square root of a given number
* without using any Built-In Functions
*/
public class SquareRootDemo2
{
public static void main(String[] args)
{
//Number for which square root is to be found
double number = -12;
//This method finds out the square root
findSquareRoot(number);
}
/*This method finds out the square root without using
any built-in functions and displays it */
public static void findSquareRoot(double number)
{
boolean isPositiveNumber = true;
double g1;
//if the number given is a 0
if(number==0)
{
System.out.println("Square root of "+number+" = "+0);
}
//If the number given is a -ve number
else if(number<0)
{
number=-number;
isPositiveNumber = false;
}
//Proceeding to find out square root of the number
double squareRoot = number/2;
do
{
g1=squareRoot;
squareRoot = (g1 + (number/g1))/2;
}
while((g1-squareRoot)!=0);
//Displays square root in the case of a positive number
if(isPositiveNumber)
{
System.out.println("Square roots of "+number+" are ");
System.out.println("+"+squareRoot);
System.out.println("-"+squareRoot);
}
//Displays square root in the case of a -ve number
else
{
System.out.println("Square roots of -"+number+" are ");
System.out.println("+"+squareRoot+" i");
System.out.println("-"+squareRoot+" i");
}
}
}
You can compute sin(x) manually/numerically using Taylor's Series.
using pow() function.. ..
knioubuhy yig hnm vuigvgh ujhb jhbihjbnihkjlkmmnlk
You would have to write your own code for a modulation (Matlab has a convolution function not in the tools), otherwise you can use its built in function in the signal processing toolbox.
Using its Taylor-series.
One.
Math.sqrt(number) function is used to find the square root of a number.. try it
using max function
shashi
no way... use awgn function in matlab
plz as soon as possible give me the program for shorting an array in asscending order without using any sort function in c++
using built in function