متدی به نام exp بنویسید تا زمانی که مقدار جمله کمتر از 1E-7 نباشد.
public class SeriE { public static void main(String[] args) { double e = exp(2); System.out.println(e); } public static double exp(int x) { double e = 0,item = 1,i = 1; while(item >= 1E-7){ e+= item; item = item*x/i; i++; } return e; }} ...
متدی به نام merge معرفی نمایید وکه دوآرایه نامرتب را بگیرد و باهم ادغام کند و در آخر هم آرایه مرتب شده را برای نتیجه برگرداند.
MergeAraye &SelectionSort
import java.util.Scanner;
public class MergeAraye { public static void main(String[] args) { int [] a = {3,8,9,13}; int [] b = {2,11,12}; int [] c = Merge(a,b); SelectionSort(c); for(int number : c) System.out.print(number +""); System.out.println(); } public static int[] Merge(int [] a, int [] b) { int [] c = new int ...
SelectionSort
public class SelectionSort { public static void main(String[] args) { double [] a = {6,8,99,90,98,89}; SelectionSort(a); for(double number: a) System.out.print(number +","); System.out.println(); } public static void SelectionSort(double[] list) { for (int i = 0; i < list.length-1; i++) { double Min = list[i]; int MinIndex = i ; for (int j = i+1; j < list.length; j++) { if (Min > list[j]){ Min = list[j]; MinIndex = j; } } if(MinIndex != i){ list[MinIndex] = list[i]; list[i] = Min; } } } } ...
BubbleSort
public class BubbleSort { public static void main(String[] args) { int [] a = {2,9,7,8,4}; BubbleSort(a); for(int number: a) System.out.print(number+","); System.out.println(); } public static void BubbleSort(int[] list) { for (int i = 0; i < list.length-1; i++) { for (int j = 0; j < list.length-1-i; j++) { if(list[j] > list[j+1]){ int t = list [j];public class BubbleSort { public static void main(String[] args) { int [] a = {2,9,7,8,4}; BubbleSort(a); for(int number: a) System.out.print(number+","); System.out.println(); } public static void BubbleSort(int[] ...
BinarySearch
public class BinarySearch {
public static void main(String[] args) { int[] list = {12,15,23,45,56,89}; int i = BinarySearch(list, 33); System.out.println(i);
}
public static int BinarySearch(int[] list, int key) { int low = 0; int high = list.length - 1; while (high >= low) { int mid = (high + low) / 2; if (key < list[mid]) high = mid - 1; else if (key == list[mid]) { return mid; } else { low = mid + 1; } }
return -1; }} ...
LinearSearch
public class LinearSearch { public static void main(String[] args) { int [] list = {3,4,5,7,9,8,10}; int i = LinearSearch(list,8); System.out.println(i); } public static int LinearSearch(int[] list , int key) { for (int i = 0; i < list.length; i++) { if (key == list[i]) return i; } return -1; }} ...
MergeAraye
import java.util.Scanner;
public class MergeAraye { public static void main(String[] args) { int [] a = {1,3,4,5}; int [] b = {5,7}; int [] c = Merge(a,b); for(int number : c) System.out.print(number +""); System.out.println(); } public static int[] Merge(int [] a, int [] b) { int [] c = new int [a.length+b.length]; for (int i = 0 ; i < a.length;i++) c[i]=a[i]; for (int i = 0; i < b.length; i++) { c[i+a.length]=b[i]; } return c; } } ...
fact Method
import java.util.Scanner;
public class fact { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); System.out.println(n+"!"+"="+fact(n)); } public static long fact(int n) { int fact = 1; for (int i = 2; i < n; i++) { fact = fact * i; } return fact; }} ...
Nامین عدد فیبوناچی چند است:
Fib Method
import java.util.Scanner;
public class fibonachi {
public static void main(String[] args) { Scanner input = new Scanner(System.in); int N = input.nextInt(); if (N < 3) { System.out.println("1"); return; } System.out.println(N + "min is:" + fib(N)); }
public static int fib(int N) {
int a = 1; int b = 1; for (int i = 3; i <= N; i++) { int tmp = b; b = a + b; a = tmp; } return b; }}
...