Tutorial by Examples: io

To setup JVM options inside elastic beanstalk, your bundle file must be like this: -bundle.zip |--.ebextensions //do not forget the dot at the beginning of the name |--jvm.config |--java_app.jar And, the jvm.config file must be set like this: option_settings: ...

Maximum Path Sum is an algorithm to find out a path such that sum of element(node) of that path is greater than any other path. For example, let's we have a we a triangle as shown below. 3 7 4 2 4 6 8 5 9 3 In above triangle, find the maximum path which has ma...

public class Node { public int Value; public Node Left, Right; public Node(int item) { Value = item; Left = Right = null; } } class Res { public int Val; } public class MaximumPathSum { Node _root; int FindMaxUtil(Node node, Re...

Public Function TableExists(value as String) as Boolean On Error Resume Next TableExists = Len(CurrentDb.Tabledefs(value).Name & "") > 0 End Function

To download Sublime Text, visit the download section on their website. There are various builds for different operating systems including: OXS Windows Ubuntu (64 & 32 bit) Once Sublime Text has been successfully downloaded, simply open the .dmg file to start the installation process. A...

tkinter is a GUI toolkit that provides a wrapper around the Tk/Tcl GUI library and is included with Python. The following code creates a new window using tkinter and places some text in the window body. Note: In Python 2, the capitalization may be slightly different, see Remarks section below. ...

Generally, each model maps to a single database table.We to write the field type,limits,size,etc in model.py file of the app. This will create the necessary table and fields in the database. ''' models.py ''' from django.db import models class table_name(models.Model): fie...

Detailed instructions on getting telerik set up or installed.

Maximum subarray problem is the method to find the contiguous subarray within a one-dimensional array of numbers which has the largest sum. The problem was originally proposed by Ulf Grenander of Brown University in 1977, as a simplified model for maximum likelihood estimation of patterns in digiti...

public class MaximumSubarray { private static int Max(int a, int b) { return a > b ? a : b; } static int MaxSubArray(int[] input, int n) { int max = input[0]; int currentMax = input[0]; for (int i = 1; i < n; i++) { ...

(input) output = 0 for cycleStart from 0 to length(array) - 2 item = array[cycleStart] pos = cycleStart for i from cycleStart + 1 to length(array) - 1 if array[i] < item: pos += 1 if pos == cycleStart: continue while item == array[pos]: ...

public class CycleSort { public static void SortCycle(int[] input) { for (var i = 0; i < input.Length; i++) { var item = input[i]; var position = i; do { var k = input.Where((t, j) => position != ...

01 some-string PIC X(32). ... MOVE " a string literal" TO some-string DISPLAY ":" some-string ":" DISPLAY ":" FUNCTION TRIM(some-string) ":" DISPLAY ":" FUNCTION TRIM(some-string LEADING) ":" DISPLAY ":" F...

Constraints: Input (an array to be sorted) Number of element in input (n) Keys in the range of 0..k-1 (k) Count (an array of number) Pseudocode: for x in input: count[key(x)] += 1 total = 0 for i in range(k): oldCount = count[i] count[i] = total total += oldCount for...

public class CountingSort { public static void SortCounting(int[] input, int min, int max) { var count = new int[max - min + 1]; var z = 0; for (var i = 0; i < count.Length; i++) count[i] = 0; foreach (int i in input) co...

public class HeapSort { public static void Heapify(int[] input, int n, int i) { int largest = i; int l = i + 1; int r = i + 2; if (l < n && input[l] > input[largest]) largest = l; if (r < n && input[r] ...

public class PigeonholeSort { private static void SortPigeonhole(int[] input, int n) { int min = input[0], max = input[n]; for (int i = 1; i < n; i++) { if (input[i] < min) min = input[i]; if (input[i] > max) max = input[i]; ...

insertSort :: Ord a => [a] -> [a] insertSort [] = [] insertSort (x:xs) = insert x (insertSort xs) insert :: Ord a => a-> [a] -> [a] insert n [] = [n] insert n (x:xs) | n <= x = (n:x:xs) | otherwise = x:insert n xs

public class CatalanNumber { public static int Main(int number) { int result = 0; if (number <= 1) return 1; for (int i = 0; i < number; i++) { result += Main(i)*Main(number - i - 1); } return result; } }

Dynamic Time Warping(DTW) is an algorithm for measuring similarity between two temporal sequences which may vary in speed. For instance, similarities in walking could be detected using DTW, even if one person was walking faster than the other, or if there were accelerations and decelerations during ...