# Time complexity of sampling algorithm

**URL:** https://discuss.pennylane.ai/t/time-complexity-of-sampling-algorithm/2366
**Category:** PennyLane Help
**Created:** [December 7, 2022, 12:37am UTC](https://discuss.pennylane.ai/t/time-complexity-of-sampling-algorithm/2366 "2022-12-07T00:37:48Z")
**Posts on this page:** 1
**Showing post:** 2

<div class="post-metadata">

### Author: ![CatalinaAlbornoz](https://yyz2.discourse-cdn.com/flex012/user_avatar/discuss.pennylane.ai/catalinaalbornoz/32/1196_2.png) [@CatalinaAlbornoz](https://discuss.pennylane.ai/u/CatalinaAlbornoz)
#### Post date: [December 12, 2022, 11:08pm UTC](https://discuss.pennylane.ai/t/time-complexity-of-sampling-algorithm/2366/2 "2022-12-12T23:08:52Z")

</div>

Hi @MUSHKAN_SUREKA ,

Thank you for your question. Unfortunately I don’t have an answer but you could calculate it using the [time](https://docs.python.org/3/library/time.html) library. You can find an example of how to use it [here](https://discuss.pennylane.ai/t/measuring-execution-time/196).

I hope this can help you find the answer to your question.

---

_[View the full topic](https://discuss.pennylane.ai/t/time-complexity-of-sampling-algorithm/2366)._