What is Tail Recursion?

Here you will learn about what is tail recursion with example. Tail recursion refers to recursive call at last line. The tail recursive functions considered better as the recursive call is at the last statement so there is nothing left to do in the current function. It saves the current function’s stack frame is of …

What is Tail Recursion? Read More »

Java Program to Find Smallest and Largest Element in an Array

import java.util.Scanner; //import Scanner class in our program class demo { public static void main(String…s) { int i,n,large,small; Scanner sc=new Scanner(System.in); //used to read from keyboard System.out.print(“Enter number of elements:”); n=sc.nextInt(); int a[]=new int[n]; System.out.print(“nEnter elements of Array:”); for(i=0;i<n;++i) a[i]=sc.nextInt(); large=small=a[0]; for(i=1;i<n;++i) { if(a[i]>large) large=a[i]; if(a[i]<small) small=a[i]; } System.out.print(“nSmallest Element:”+small); System.out.println(“nLargest Element:”+large); } }

this Keyword in Java

this holds the reference of current object. Observe below example: class demo {                 int  x=10;                 void show(int x,demo d1)                 {                                 System.out.println(this.x);                                 System.out.println(d1.x);                                 System.out.println(x);                 }                 public static void main(String…s)                 {                                 demo d1=new demo();                                 d1.show(20,d1);                 } } Output: 10 10 20 In Java by default …

this Keyword in Java Read More »