zeroones.org 01. Example: For-each loop apply on string type array. class stringForEachLoop { public static void main(String[] args) { String fruits[] = {"Orange", "Apple", "Mango", "Banana", "Grapes"}; for (String element: fruits) …
01. Example: class printAllAlphabets { public static void main(String args[]) { char alphabet; for (alphabet = 'a'; alphabet <= 'z'; alphabet++) System.out.print(alphabet + " "); System.out.print("n"); for (alphabet = 'A'; …
01. Example: import java.util.Scanner; class BreakContinueWhileLoop { public static void main(String[] args) { int N; Scanner input = new Scanner(System.in); while (true) { System.out.print("nInput An Integer: "); N = input.nextInt(); …
01. Example: import java.util.Scanner; class breakStatementWithWhileLoop { public static void main(String[] args) { int N; Scanner input = new Scanner(System.in); while (true) { System.out.print("Input An Integer: "); N = input.nextInt(); …
01. Example: import java.util.Scanner; class breakStatementWithWhileLoop { public static void main(String[] args) { int N; Scanner input = new Scanner(System.in); while (true) { System.out.print("Input An Integer: "); N = input.nextInt(); …
01. Example: def cocktailShakerSorting(data): def swap(i, j): data[i], data[j] = data[j], data[i] upper = len(data) – 1 lower = 0 flag = False while (not flag and upper – lower …
01. Example: def introsort(data): maxdepth = (len(data).bit_length() – 1)*2 introSortingHelper(data, 0, len(data), maxdepth) def introSortingHelper(data, start, end, maxdepth): if end – start <= 1: return elif maxdepth == 0: heapSorting(data, …
01. Example: def heapSorting(data): buildMaxHeap(data) for i in range(len(data) – 1, 0, -1): data[0], data[i] = data[i], data[0] maxHeapify(data, index=0, size=i) def parent(i): return (i – 1)//2 def left(i): return …
01. Example: def mergeSorting(data, start, end): if end – start > 1: mid = (start + end)//2 mergeSorting(data, start, mid) mergeSorting(data, mid, end) mergeList(data, start, mid, end) def mergeList(data, start, …
01. Example: def quickSorting(data, start, end): if end – start > 1: p = partition(data, start, end) quickSorting(data, start, p) quickSorting(data, p + 1, end) def partition(data, start, end): pivot …