{"id":1646,"date":"2016-09-16T16:04:36","date_gmt":"2016-09-16T16:04:36","guid":{"rendered":"http:\/\/codethataint.com\/blog\/?p=1646"},"modified":"2019-05-07T13:39:54","modified_gmt":"2019-05-07T13:39:54","slug":"java-programs","status":"publish","type":"post","link":"https:\/\/codethataint.com\/blog\/java-programs\/","title":{"rendered":"Java Programs"},"content":{"rendered":"

Fibonacci(without using recursion)<\/strong><\/p>\n

\r\npublic class Test\r\n{\r\n  public static void main(String[] args)\r\n  {\r\n     int a=0 , b=0 , c=1;\r\n     System.out.println(a);\r\n     System.out.println(b);\r\n\r\n     for(int i=0;i<15;i++)\r\n     {\r\n        a=b;\r\n        b=c;\r\n        c=a+b;\r\n        System.out.println(c);\r\n     }\r\n   }\r\n}\r\n<\/pre>\n
Fibonacci(using recursion)<\/strong><\/p>\n
\r\n7\r\n<\/pre>\n
Reverse array without Temp Array<\/strong><\/p>\n
\r\npublic static int[] reverseArrayWithoutTempArray(int[] array) \r\n{\r\n    int i = 0, j = array.length - 1;\r\n \r\n    for (i = 0; i < array.length \/ 2; i++, j--) \r\n    {\r\n        int temp = array[i];\r\n        array[i] = array[j];\r\n        array[j] = temp;\r\n    }\r\n    return array;\r\n}\r\n<\/pre>\n
Iterate random integer array and print the values greater than the current value<\/strong><\/p>\n
\r\nclass Main \r\n{\r\n static void printNGE(int arr[]) \r\n {\r\n  int highestVal = 0, i, j;\r\n\r\n  for (i = 0; i < arr.length; i++) \r\n  {\r\n       if (arr[i] > highestVal) \r\n       {\r\n        System.out.println(arr[i]);\r\n        highestVal = arr[i];\r\n       }\r\n  }\r\n }\r\n\r\n public static void main(String args[]) \r\n {\r\n  int arr[]= {11, 13, 21, 3, 45};\r\n  printNGE(arr);\r\n }\r\n}\r\n<\/pre>\n
Inheritance program with Class and Interface.Find and print the Area and Perimeter for Rectangle,Square and Circle<\/strong><\/p>\n
    \n
  1. Interface Shape<\/li>\n
  2. Rectangle class implements Shape<\/li>\n
  3. Circle class extends Rectangle<\/li>\n<\/ol>\n
    \r\ninterface Shape \r\n{\r\n void input();\r\n void area();\r\n}\r\n\r\nclass Circle implements Shape \r\n{\r\n int r = 0;\r\n double pi = 3.14, ar = 0;\r\n \r\n @Override\r\n public void input() \r\n {\r\n  r = 5;\r\n }\r\n \r\n @Override\r\n public void area() \r\n {\r\n  ar = pi * r * r;\r\n  System.out.println("Area of circle:" + ar);\r\n }\r\n}\r\n\r\nclass Rectangle extends Circle \r\n{\r\n int l = 0, b = 0;\r\n double ar;\r\n\r\n public void input() \r\n {\r\n  super.input();\r\n  l = 6;\r\n  b = 4;\r\n }\r\n\r\n public void area() \r\n {\r\n  super.area();\r\n  ar = l * b;\r\n  System.out.println("Area of rectangle:" + ar);\r\n }\r\n}\r\n\r\npublic class Demo \r\n{\r\n public static void main(String[] args) \r\n {\r\n  Rectangle obj = new Rectangle();\r\n  obj.input();\r\n  obj.area();\r\n }\r\n}\r\n<\/pre>\n
    \r\nArea of circle:78.5\r\nArea of rectangle:24.0\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
    Fibonacci(without using recursion) public class Test { public static void main(String[] args) { int a=0 , b=0 , c=1; System.out.println(a); System.out.println(b); for(int i=0;i<15;i++) { a=b; b=c; c=a+b; System.out.println(c); } } } Fibonacci(using recursion) 7 Reverse array without Temp Array public static int[] reverseArrayWithoutTempArray(int[] array) { int i = 0, j = array.length – 1; for… Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[278],"tags":[],"class_list":["post-1646","post","type-post","status-publish","format-standard","hentry","category-program-solving"],"_links":{"self":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/1646","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/comments?post=1646"}],"version-history":[{"count":6,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/1646\/revisions"}],"predecessor-version":[{"id":3370,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/1646\/revisions\/3370"}],"wp:attachment":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/media?parent=1646"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/categories?post=1646"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/tags?post=1646"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}