---
title: "Discussion on \"DSA Part 1: Time Complexity\" | Hashnode"
description: "Discussion on \"DSA Part 1: Time Complexity\". Time Complexity is used to analyze the efficiency of the algorithm/problem you have used.\nIn short, its something on how much time it took to solve a problem. so what does it mean here?\nLet say there are 10 shops in-front of you and only one shop has..."
url: "https://hashnode.com/posts/dsa-part-1-time-complexity/6125b7c4663d427e19ffb614"
---

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

Discussion

# [DSA Part 1: Time Complexity](https://codewithprannesh.hashnode.dev/dsa-part-1-time-complexity?utm_source=hashnode&utm_medium=feed)

Time Complexity is used to analyze the efficiency of the algorithm/problem you have used. In short, its something on how much time it took to solve a problem. so what does it mean here? Let say there are 10 shops in-front of you and only one shop has...

Aug 25, 2021 · 3 min read · codewithprannesh.hashnode.dev  
Read the article

-   [#data-structures](https://hashnode.com/tag/data-structures)

## Written by

[Prannesh](https://hashnode.com/@codewithprannesh)

@codewithprannesh

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

HPC Engineer from 7 am to 4 pm || Data Scientist and Full Stack Developer from 5 pm to 1 am

23, HPC Engineer & Freelancer | I write about Tech, Products and Start-up

## Responses 1

Markdown supported · ⌘↵ to post

[K Ahamed](https://hashnode.com/@datailm)

[Sep 2, 2021](https://hashnode.com/posts/dsa-part-1-time-complexity/6125b7c4663d427e19ffb614/comment/613026b1c21ac123ca37862b)

Good one. You can show the time complexity in proper way like \\(O(n^2)\\) by using LaTex command. Please refer [How to use Maths notation in blog](https://datailm.hashnode.dev/math-tex)