answersLogoWhite

0

Should you all have the same values?

User Avatar

Anonymous

14y ago
Updated: 8/19/2019

Heck no everyone should be different

User Avatar

Wiki User

14y ago

What else can I help you with?

Related Questions

What numbers have opposites that are the same as their absolute values?

All numbers have opposites that are the same as their absolute values.


Why does the field have all the same values?

The field has all the same values because they are likely uniform or consistent throughout, possibly due to a specific condition or factor that influences the entire area.


What values must be the same in all parts of a series circuit?

Current


What are expressions that have the same value for all values of the variables?

Equivalent Expression


What are expressions that have the same value for all values of the variables called?

equivalent expression


Can there be a 0 variance and if so what do you label it?

If all values in the distribution are the same, yes.


What is the standard deviation of a set data in which all the data values are the same?

It is 0.


Can a standard deviation be 0?

Yes. For this to happen, the values would all have to be the same.


In a circuit the voltage across all resistors is the same.?

lf all resistors are in parallel, yes. If they are in series, not necessarily - this depends on the resistor values (if they are all the same, then yes, if not no).


What is the value of the mode when all of the values in the data set are different or they all have the same frequency?

When all values in a data set are different, there is no mode, as no number appears more frequently than others. Similarly, if all values have the same frequency, there is also no mode since no single value dominates in occurrence. In both cases, the data set is considered to be multimodal or has no mode at all.


Two algebraic expressions are if they have the same value for all values of their variable?

They are identical or equivalent.


If quick sort and merge sort have same elements then what will be the complexity of both algorithms?

quicksort should be O(n^2), but merge sort should be O(nlogn). but if you can modify partition algorithm with checking all values same in array from p to r, it could be O(nlogn).