Testing of sequences by simulation

Details Testing of sequences by simulation Testing of sequences by simulation

2010-11-30

arxiv.org/abs/1012.0032v1

Acta Univ. Sapientiae Informatica, vol. 2 no. 2 (2010) 135-153

Computer Science

Data Structures and Algorithms

Scientific paper

Let $\xi$ be a random integer vector, having uniform distribution \[\mathbf{P} \{\xi = (i_1,i_2,...,i_n) = 1/n^n \} \ \hbox{for} \ 1 \leq i_1,i_2,...,i_n\leq n.\] A realization $(i_1,i_2,...,i_n)$ of $\xi$ is called \textit{good}, if its elements are different. We present algorithms \textsc{Linear}, \textsc{Backward}, \textsc{Forward}, \textsc{Tree}, \textsc{Garbage}, \textsc{Bucket} which decide whether a given realization is good. We analyse the number of comparisons and running time of these algorithms using simulation gathering data on all possible inputs for small values of $n$ and generating random inputs for large values of $n$.

Affiliated with

Also associated with

No associations

Rating

Testing of sequences by simulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Testing of sequences by simulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing of sequences by simulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-574148