Tutorial by Examples: basic

Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more c...
Getting You Browser Ready - Polyfill it Create a new landing page for our element, at index.html. Include polyfills for a custom element to work.Also import the custom element g-map, which we registered with Polymer. Note: Webcomponents, are the necessary polyfill for browser support. Polym...
With Class-Based Views, we use classes instead of methods to implement our views. A simple example of using Class-Based Views looks as follows: from flask import Flask from flask.views import View app = Flask(__name__) class HelloWorld(View): def dispatch_request(self): ret...
Pancake Sort is a the colloquial term for the mathematical problem of sorting a disordered stack of pancakes in order of size when a spatula can be inserted at any point in the stack and used to flip all pancakes above it. A pancake number is the minimum number of flips required for a given number o...
The Longest Increasing Subsequence problem is to find subsequence from the give input sequence in which subsequence's elements are sorted in lowest to highest order. All subsequence are not contiguous or unique. Application of Longest Increasing Subsequence: Algorithms like Longest Increasing Subs...
'Base string Dim exStr : exStr = " <Head>data</Head> " 'Left Dim res: res = Left(exStr,6) 'res now equals " <Head" 'Right Dim res: res = Right(exStr,6) 'res now equals "Head> " 'Mid Dim res: res = Mid(exStr,8,4) 'res now equals "data&quot...
To add the BottomNavigationView follow these steps: Add in your build.gradle the dependency: compile 'com.android.support:design:25.1.0' Add the BottomNavigationView in your layout: <android.support.design.widget.BottomNavigationView xmlns:android="http://schemas.andro...
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...
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...
One of the most interesting Number Patterns is Pascal's Triangle. The Name "Pascal's Triangle" named after Blaise Pascal, a famous French Mathematician and Philosopher. In Mathematics, Pascal's Triangle is a triangular array of binomial coefficients.The rows of Pascal's triangle are conve...
The Shortest Common Super Sequence is a problem closely related to the longest common subsequence, which you can use as an external function for this task. The shortest common super sequence problem is a problem closely related to the longest common subsequence problem. A shortest common superseque...
scan is used for calling function multiple times over a list of values, the function may contain state. scan syntax (as of theano 0.9): scan( fn, sequences=None, outputs_info=None, non_sequences=None, n_steps=None, truncate_gradient=-1, go_backwards=False, m...
Sliding window algorithm is used to perform required operation on specific window size of given large buffer or array. Window starts from the 1st element and keeps shifting right by one element. The objective is to find the minimum k numbers present in each window. This is commonly know as Sliding w...
The Maya GUI toolkit creates a variety of UI elements in a simple, imperative form. There are basic commands to create and edit GUI widgets; the widgets are identified by a unique string name. All gui commands take the same basic form: you supply a command type and the string name of the object yo...
Service broker is technology based on asyncronous communication between two(or more) entities. Service broker consists of: message types, contracts, queues, services, routes, and at least instance endpoints More: https://msdn.microsoft.com/en-us/library/bb522893.aspx
USE [MyDatabase] CREATE MESSAGE TYPE [//initiator] VALIDATION = WELL_FORMED_XML; GO CREATE CONTRACT [//call/contract] ( [//initiator] SENT BY INITIATOR ) GO CREATE QUEUE InitiatorQueue; GO CREATE QUEUE TargetQueue; GO CREATE SERVICE InitiatorService ON QUEUE...
For this demonstration we will use service broker construction created in another part of this documentation. Mentioned part is named 3. Create basic service broker construction on database (single database communication). USE [MyDatabase] DECLARE @ch uniqueidentifier = NEWID() DECLARE @msg XML...
Almost any controller needs some external dependencies to work. Here is a way to configure a dependency object (or its factory) and pass it to a controller. Doing so will help to sustain a separation of concerns, keep code clear and testable. Say, we have an interface and its implementation that...
Content Negotiation can be defined as the process of selecting best representation for a given resource. So Content negotiation means the client and server can negotiate between them so that client can get data according to their required format. There are three points on which internet depends, ...
Define a new basic command A macro can be defined using \newcommand. For example: \newcommand{\foo}{Just foo, you see?} defines a macro \foo that expands to Just foo, you see?. It can then be used like any built-in command, for example after that definition: He said: ``\foo'' expands to He...

Page 32 of 43