Sample Program<\/p>\n\n\n\n
Find Largest \/ Smallest <\/p>\n\n\n\n
public class FindLargestSmallestNumberMain {\n\t\n public static void main(String[] args) {\n\t\n\t\/\/array of 10 numbers\n\tint arr[] = new int[]{12,56,76,89,100,343,21,234};\n\t\t\n\t\/\/assign first element of an array to largest and smallest\n\tint smallest = arr[0];\n\tint largest = arr[0];\n\t\t\n\tfor(int i=1; i< arr.length; i++)\n\t{\n\tif(arr[i] > largest)\n\t\tlargest = arr[i];\n\telse if (arr[i] < smallest)\n\t\tsmallest = arr[i];\n\t\t\n\t}\n\tSystem.out.println(\"Smallest Number is : \" + smallest);\n\tSystem.out.println(\"Largest Number is : \" + largest); \n}\n\n}<\/pre>\n\n\n\nFinding Largest \/ Smallest sorted data<\/p>\n\n\n\n
class FindSmallSorted {\t\n public static void main(String[] args) {\n\t\tint[] nums={6,-1,-2,-3,0,1,2,3,4};\n\t\tArrays.sort(nums);\n\t\tfor (int i = 0; i < nums.length; i++) {\n\t\t\tSystem.out.print(\" \"+ nums[i]);\n\t\t}\n\t\tSystem.out.println();\n\t\tSystem.out.println(\"Minimum = \" + nums[0]);\n\t\tSystem.out.println(\"Maximum = \" + nums[nums.length-1]);\n\t}\n}<\/pre>\n\n\n\n<\/p>\n\n\n\n
Linear Search<\/p>\n\n\n\n
public class LinearSearchExample{ \n public static int linearSearch(int[] arr, int key){ \n for(int i=0;i<arr.length;i++){ \n if(arr[i] == key){ \n return i; \n } \n } \n return -1; \n } \n public static void main(String a[]){ \n int[] a1= {30,20,10,50,40,90}; \n int key = 50; \n System.out.println(key+\" is found at index: \"+linearSearch(a1, key)); \n } \n} <\/pre>\n\n\n\n<\/p>\n\n\n\n
Searching<\/p>\n\n\n\n
import java.util.*;\nclass Untitled{\n public static void main(String[] args){\n \/\/array\n int[] a = {3,2,4,3,7,9,8,10};\n boolean ans = contains(a,100);\n if (ans){\n System.out.println(\"Number found \");\n }else{\n System.out.println(\"Number not found \");\n }\n }\n public static boolean contains(int[] a, int b){\n for (int i:a){\n System.out.println(\"Comparing with \"+i);\n \n if (i==b){\n return true;\n }\n }\n return false;\n }\n\n}<\/pre>\n\n\n\n<\/p>\n\n\n\n
import java.util.*;\nclass Untitled {\n\tpublic static void main (String[] args){\n\t\tint[] a = {1,2,3,4,7,8,9,10,11};\n\t\tboolean ans = contains(a, 5);\n\t\tif (ans){\n\t\t\tSystem.out.println(\"Number found\");\n\t\t}else {\n\t\t\tSystem.out.println(\"Number not found\");\n\t\t}\n\t}\n\tpublic static boolean contains(int [] a, int b){\n\t\tfor (int i:a){\n\t\t\tSystem.out.println(\"Comparing with \"+i);\n\t\t\tif (i==b){\n\t\t\t\treturn true;\n\t\t\t}else if (i>b){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n}\n<\/pre>\n\n\n\nSample Gausian Elimination<\/p>\n\n\n\n
\n\nx + y + z = 10\t\t\t\t1\t1\t1\t|\t10\n3x + 2z = 19\t\t\t\t3\t0\t2\t|\t19\n3x + 2y + 4z = 27\t\t\t3\t2\t4\t|\t27\n\n\n1. Swap rows\n2. Multiply a row a constant (not zero)\n3. Add or subtract row or multiply\n\n1\t1\t1\t|\t10\t\t\t3\t2\t4\t|\t27\n3\t0\t2\t|\t19\t\t\t3\t2\t4\t|\t27\t\t\n1\t1\t1\t|\t10\t\t\t3\t0\t2\t|\t19\n\n1\t1\t1\t|\t10\t\t\t1\t1\t1\t|\t10\n3\t0\t2\t|\t19\t\t 3(2)0(2)2(2) | 19(2)\n3\t2\t4\t|\t27\t\t\t3\t2\t4\t|\t27\n\nR2-R1\n1\t1\t1\t|\t10\t\t\t1\t1\t1\t|\t10\n1\t3\t2\t|\t19\t\t 1-1 3-1 2-1\t| \t19-10\n3\t2\t4\t|\t27\t\t\t3\t2\t4\t|\t27\n\t\t\n\t\t\t\t\t\t\t1\t1\t1\t|\t10\n\t\t\t\t\t\t\t0\t2\t1\t|\t9\n\t\t\t\t\t\t\t3\t2\t4\t|\t27\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tAugmented matrix\n\t\t\t\t\t\t\t\n\t\tx + y + z = 10\t\t\t\t1\t1\t1\t|\t10\n\t\tx + 3y +2z = 19\t\t\t\t1\t3\t2\t|\t19\n\t\t3x + 2y + 4z = 27\t\t\t3\t2\t4\t|\t27\t\t\n\t\t\n\t\t\t\t\t\t\t\t\tR2 - R1\n\t\t\t\t\t\t\t\t\t1\t1\t1\t|\t10\n\t\t\t\t\t\t\t\t\t0\t2\t1\t|\t9\n\t\t\t\t\t\t\t\t\t3\t2\t4\t|\t27\n\t\t\n\t\t\t\t\t\t\t\t\tR3 - 3R1\n\t\t\t\t\t\t\t\t\t1\t1\t1\t|\t10\n\t\t\t\t\t\t\t\t\t0\t2\t1\t|\t9\n\t\t\t\t\t\t\t\t\t0\t-1 1\t| -3\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tR2 + 2R3\n\t\t\t\t\t\t\t\t\t1\t1\t1\t|\t10\n\t\t\t\t\t\t\t\t\t0\t0\t3\t|\t3\n\t\t\t\t\t\t\t\t\t0\t-1 1\t| -3\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tSWAP R2 AND R3\n\t\t\t\t\t\t\t\t\t1\t1\t1\t|\t10\n\t\t\t\t\t\t\t\t\t0\t-1 1\t| -3\n\t\t\t\t\t\t\t\t\t0\t0\t3\t|\t3\n\t\t\t\t\t\t\t\t\t<\/pre>\n","protected":false},"excerpt":{"rendered":"Sample Program Find Largest \/ Smallest Finding Largest \/ Smallest sorted data Linear Search Searching Sample Gausian Elimination<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/xcodeph.net\/index.php\/wp-json\/wp\/v2\/pages\/554"}],"collection":[{"href":"https:\/\/xcodeph.net\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/xcodeph.net\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/xcodeph.net\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/xcodeph.net\/index.php\/wp-json\/wp\/v2\/comments?post=554"}],"version-history":[{"count":3,"href":"https:\/\/xcodeph.net\/index.php\/wp-json\/wp\/v2\/pages\/554\/revisions"}],"predecessor-version":[{"id":558,"href":"https:\/\/xcodeph.net\/index.php\/wp-json\/wp\/v2\/pages\/554\/revisions\/558"}],"wp:attachment":[{"href":"https:\/\/xcodeph.net\/index.php\/wp-json\/wp\/v2\/media?parent=554"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}