Home
Feed

Extend

Hashnode Pro
Hashnode for Agents

Resources

The foreword
Hashnode gql skill

Buildful - AI coding agent that delivers frontier-level results at a fraction of the cost Bug0 - The AI-native e2e QA regression testing Hackathons Changelog Brand @hashnode on X Hashnode on LinkedIn Support - hello+support@hashnode.com Code of Conduct Terms Privacy Sitemap

Sign in

Search Hashnode

Search posts, tags, users, and pages

Discussion

DSA Part 1: Time Complexity

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.devRead the article

#data-structures

Written by

Prannesh

@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

Responses1

Markdown supported · ⌘↵ to post

K Ahamed

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