---
title: "Discussion on \"What is logarithms in time complexity means?\" | Hashnode"
description: "Discussion on \"What is logarithms in time complexity means?\". If we talk about some sorting algorithms we'll see their running time is in the order of \\(O(n log(n))\\) time. In this article we'll talk why logarithm time is useful and how it's working?\nLet's imagine the following task\nfor i in range(10):\n    prin..."
url: "https://hashnode.com/posts/log-time-complexity/5faf6d5308f9e538a01375d1"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [What is logarithms in time complexity means?](https://publications.theroyakash.com/log-time-complexity?utm_source=hashnode&utm_medium=feed)

If we talk about some sorting algorithms we'll see their running time is in the order of \\(O(n log(n))\\) time. In this article we'll talk why logarithm time is useful and how it's working? Let's imagine the following task for i in range(10): prin...

Nov 14, 2020 · 5 min read · publications.theroyakash.com  
Updated Dec 23, 2020  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#python3](https://hashnode.com/tag/python3)

## Written by

[theroyakash](https://hashnode.com/@theroyakash)

@theroyakash · Chennai, India

  
[View profile](https://hashnode.com/@theroyakash)

Computer Scientist

I go by theroyakash on the internet. I am a computer scientist, with research in high performance algorithms, data structures, distributed systems, and beyond. See my work searching google for theroyakash.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
