Just as with classical computing, we don't expect that in quantum computing the choice of a programming language will have a direct effect on the time and space complexity of most algorithms. That is, while C, Python, Rust, and Swift are all very different programming languages, quicksort is a $O(n \ln n)$ algorithm in all of them. Rather, classical languages tend to be compared on the basis of whether they are low-level or high-level, how easy they are to work with, what safety they provide the programmer (e.g.: it's more difficult to segfault in Python or Rust than in C), and so forth.
If you're interested in more resources comparing quantum languages, you may find https://www.nature.com/articles/s42254-020-00245-7 helpful. I also have a look together with Sarah Kaiser on Q# coming out soon that you may find interesting as well: https://bit.ly/qsharp-book