Hello,

I am new to systemverilog and I am curious about the time efficiency of the operations of arrays/queues/associative arrays/ dynamic arrays in SV.

For example,

- what is the time complexity of using built-in function insert() to insert an element to the middle of a SV queue? (

```
void insert (input integer index, input element_t item);
```

)

2. What is the time complexity of using the SV associative array method

```
find_index()
```

Also, I would like to know if there are any resources/tutorials/websites that I can use to learn the time complexity of some basic manipulations of different SV data structures. I have tried SystemVerilog LRM but got somewhat overwhelmed.

Is the calculation of time/space efficiency basically the same as in Java/C++?

Any tips would be appreciated!

Thank you very much!