---
title: "Mann Shah (@mannshah989) | Hashnode"
description: "Mann Shah (@mannshah989) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@mannshah989"
---

@mannshah989

# Mann Shah

@mannshah989 · Joined March 2023

### [Datatypes in Java](https://techie2.hashnode.dev/datatypes-in-java?utm_source=hashnode&utm_medium=feed)

There are two types : 1) Primitve Datatypes 2) Non-Primitive Datatypes Let's Discuss Primitive ones in this one : 1. Boolean type In this datatype it's all about true and false these are used when you want to see whether the given condition is true o...

2 min read · [techie2.hashnode.dev](https://techie2.hashnode.dev/datatypes-in-java?utm_source=hashnode&utm_medium=feed)

[Oct 22, 2023](https://hashnode.com/posts/datatypes-in-java/65353a5694da2bcafea46edd)

### [Basics OF Java](https://techie2.hashnode.dev/basics-of-java?utm_source=hashnode&utm_medium=feed)

OOPS means Object Oriented Programming it plays very important role in programming languages not just theoretically but practically too you will use all these concepts in development especially when you will learn app development. C++ and Java are ...

1 min read · [techie2.hashnode.dev](https://techie2.hashnode.dev/basics-of-java?utm_source=hashnode&utm_medium=feed)

[Oct 21, 2023](https://hashnode.com/posts/basics-of-java/6533ee824b5b7773ec6912a5)

### [Time Complexity Examples with Codes](https://techie2.hashnode.dev/time-complexity-examples-with-codes?utm_source=hashnode&utm_medium=feed)

1) printf("Hello World") The time complextiy for above will be O(1) since it will run in constant time throughout the number of iterations therefore it is called as constant time. 2) int val = 0; for(int i = 1; i <= N; i += i){ val++; } We will calcu...

1 min read · [techie2.hashnode.dev](https://techie2.hashnode.dev/time-complexity-examples-with-codes?utm_source=hashnode&utm_medium=feed)

[Oct 18, 2023](https://hashnode.com/posts/time-complexity-examples-with-codes/652fee9c647f1c17b62881c1)

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

Types of Time Complexity Analysis : 1) Worst Case Time Complexity: It is that case where the algorithm takes the longest time to complete its execution It is represented by the Big-O notation. By default we calculate the worst case time complexity wh...

1 min read · [techie2.hashnode.dev](https://techie2.hashnode.dev/time-complexity-part-2?utm_source=hashnode&utm_medium=feed)

[Oct 17, 2023](https://hashnode.com/posts/time-complexity-part-2/652e967088f42b465f20d43b)

### [Time Complextiy Basics](https://techie2.hashnode.dev/time-complextiy-basics?utm_source=hashnode&utm_medium=feed)

This is a kind of topic which most of the programmers find difficult dont worry in this blog it will made smooth as butter. Let's Get into It: Time Complexity : The amount of time taken by code to run. However, we need to remember that this is not de...

2 min read · [techie2.hashnode.dev](https://techie2.hashnode.dev/time-complextiy-basics?utm_source=hashnode&utm_medium=feed)

[Oct 16, 2023](https://hashnode.com/posts/time-complextiy-basics/652d5d07b4d9260e7821a4ef)
