Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Desvio Padrão - LPI
//'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_111 import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) { double x[] = new double[11]; x[0] = 9; x[1] = 7; x[2] = 6; x[3] = 8; x[4] = 5.5; x[5] = 3.2; x[6] = 4.8; x[7] = 10; x[8] = 2; x[9] = 9.5; x[10] = 3; double soma = 0; // Tarefa 1 - Calcula a média for (int n = 0; n <= 10; n++ ) soma = soma + x[n]; double media = soma /11; // Tarefa 2 - Criar um vetor de 11 posições // para armazenar a diferença entre x[n] e a média double dife[] = new double[11]; for (int n = 0; n <= 10; n++ ) dife[n] = x[n]-media; // Tarefa 3 - Elevar ao quadrado cada elemento de dife[n] double quad[] = new double[11]; for (int n = 0; n <= 10; n++ ) quad[n] = Math.pow(dife[n], 2); // Tarefa 4 somar os quadrados double somaquad = 0; for (int n = 0; n <= 10; n++ ) somaquad = somaquad + quad[n]; // Tarefa 5 e 6 - Dividir por 11 e extrai a raiz double desvio = Math.pow(somaquad/11, 0.5); System.out.println("Média "+ media); System.out.println("Soma dos quadrados "+ somaquad); System.out.println("Desvio "+ desvio); } }
run
|
edit
|
history
|
help
0
Print Longest String
// Java Coding Challenge - 09: Find out duplicate numbers using Array
My date and time
// Java Coding Challenge - 09: Find out duplicate numbers using HashSet
Day 1
Java: Tower of Hanoi
Convert string array to lowercase.
Abstract Inner Class
jb11.0 threads tick tock
fs