Functions , Time complexity and Space complexity || Java +DSA course || Blog 4

-

 

A Function is basically a chunk of code which can used used whenever needed and can be called multiple times.

It helps us to break our code into small parts so that it is easy to access. Once we made a function, we can forget how it is working and just call it when it needs to execute. 

Overview:

  • Function
  • Time complexity
  • Space complexity

Lets make
a function for adding two number.here , we make


By using return the value of numer1+number2 is returned outside the loop and saved in g.further the g is printed. You can even take user input by sc.nextInt();.

a,b are saved as number1 and number2 in functionname() function.

import java.util.*;
public class Main{

public static int addNumber(int number1,int number2){
return number1 + number2;//returning 30 and saving it in summNumber
}
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int a = 10;
int b = 10;
int summNumber = addNumber(a, b);//calling function using addNumber()
                     and giving arguments(a, b). saving the sum in summNumber
System.out.println(summNumber);//printing sumNumber
sc.close();
}
}


 

The output is 20.

Function helps us to keep our code neat and tidy and organized just like books.

Functions are saved as stack in the memory.

Time complexity

We hate it when a website takes even more than 2 to 3 seconds to run / load page.So as we can see time is important enough for code to run. Time depends on the operations we run.

Time complexity(n) is directly proportional to inputs. The more input the more time taken by code. Time can be in the for, of logn , n^2 ,n^3, 2n, n, etc.

3 cases are seen in time complexity:

Best case(Omega Notation, Ω(n))

Average case(Theta Notation, Θ(n))

Worst case(Big O Notation ,O(n))

Best case is of course where the time taken by code is the least. Average case is the average of time taken and the least is like the last point which will never be exceeded. So best is always 1 .Ω(1), average case is written as Θ(n+1/2). Worst case is just O(n)

Space Complexity

Space complexity refers to the total amount of memory space used by an algorithm/program, including the space of input values for execution.

This occurs due to various variables as it uses new new memories every time new arguments are given.To solve this, we should use arrays. We will learn about arrays in our next blog.

____________________________________________________________________________________

Blog 3 : https://javaanddsa.blogspot.com/2022/06/conditional-statements-and-loops-in.html#more

Blog 2 : https://javaanddsa.blogspot.com/2022/06/data-types-in-java-java-dsa-course-blog.html#more

Blog 1 : https://javaanddsa.blogspot.com/2022/05/introduction-to-java-java-dsa-course.html


Did you like our Blog4?

            Please tell us in the comment section

Comments

  1. Anonymous23 June 2022 at 05:44

    A learned useful functions due to this blog

    ReplyDelete
  2. Interesting Facts6 July 2022 at 01:07

    Time complexity is easy to learn from you

    ReplyDelete

Post a Comment

Popular posts from this blog

LinkedList Problems for Beginners DSA || Java and DSA course || Blog 17

-
Image
Linked lists are fundamental data structures in computer science, offering a dynamic and flexible way to organize and manipulate data. In this blog post, we'll dive into several common linked list problems and provide clear, step-by-step solutions using Java. Whether you're preparing for technical interviews or enhancing your data structures skills, understanding how to navigate and manipulate linked lists is crucial.   We'll explore five key linked list problems and present efficient Java implementations for each:   Question 1: Problem Statement: Given a singly linked list, remove the nth node from the end of the list and return the resulting linked list. We are provided with the head of the linked list and an integer 'n,' where 1 ≤ n ≤ length of the linked list. Example 1: Input: [1,2,3,4,5], n = 2 Output: [1,2,3,5] Explanation: In the given linked list, removing the second node from the end results in the modified list [1,2,3,5]. Example 2 : Input: [1], n = 1 ...
Read more

Introduction to Java || Java + DSA course || Blog 1

-
Image
What is y our mother tongue? It can be Eng lish, Hindi, Ja pa nes e, R ussian....m any more . There are total 7000 Languages across the world for us to Communicate. But what if we want to talk to a computer? Of course computer doesn't understand English. So what does it understand? Computer understands a simple language called as Binary . Its script contains only 0s and 1s.It seems easy to learn but it isn't. Just to write A in binary is 01000001 . So even if we just want to do a simple thing like adding 2 numbers, it will mostly be hard enough.   Due to these issue, high level languages were invented. What are they? Think of it as a mixture of human language and computer language. Due to these languages humans could command a task to the computer easily. One of the best and easy High level languages is Java Java is the language which can be run on any computer having JDK.(java development kit.We will talk about it in our 2nd blog)  Lets talk about how do we give a comman...
Read more

LinkedList in DSA || Java and DSA course || Blog 16

-
Image
I n simple words, a collection which can contain many objects of the same type, like the ArrayList is a LinkedList. Arraylist uses dynamic array. Lets say we take an array size of 5. we gave input as 1,2,3,4,5. Now, if we gave it one more value, It creates a new arraylist of sizex2 = 5x2 = 10. it copies data from the first arraylist and then appends the new value. if something is removed between the arraylist, every value shifts one by one. Same is with the insert. From this, we can say that arraylist is better for storing values instead of manipulating it. So what is the difference between ArrayList and LinkedList? In this blog we will take a look into Singular LinkedList and code related to it. For a quick overview, contents are, What is LinkedList? Difference between arraylist and linkedlist Creating Node class Add Node at beginning Extend a node Delete first node Delete last node What is LinkedList? LinkedList is nothing but nodes connected to each other. A node is a point ...
Read more