Tutorial by Examples: on

In ruby you can add methods to existing instances of any class. This allows you to add behavior to and instance of a class without changing the behavior of the rest of the instances of that class. class Example def method1(foo) puts foo end end #defines method2 on object exp exp = E...
Detailed instructions on getting operating-system set up or installed.
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...
I used C# language to implement Selection sort algorithm. public class SelectionSort { private static void SortSelection(int[] input, int n) { for (int i = 0; i < n - 1; i++) { var minId = i; int j; for (j = i + 1; j < n; j++...
There are two options to render components on server: renderToString and renderToStaticMarkup. renderToString This will render React components to HTML on server. This function will also add data-react- properties to HTML elements so React on client won't have to render elements again. import { r...
This document explains how to display your GitHub feeds/timeline on your website. Example: A live example is available at: https://newtonjoshua.com GitHub timeline: GitHub provides the public timeline for any user in Atom format. You can view your timeline at: https://github.com/{{GitHub...
We want to be able to compile below component and render it in our webpage Filename: src/index.jsx import React from 'react'; import ReactDOM from 'react-dom'; class ToDo extends React.Component { render() { return (<div>I am working</div>); } } ReactDOM.re...
Create a file webpack.config.js in the root of your working directory Filename: webpack.config.js module.exports = { entry: __dirname + "/src/index.jsx", devtool: "source-map", output: { path: __dirname + "/build", filename: "bund...
Create a file .babelrc in the root of our working directory Filename: .babelrc { "presets": ["es2015","react"] }
Setup a simple html file in the root of the project directory Filename: index.html <!DOCTYPE html> <html> <head> <meta charset="utf-8"> <title></title> </head> <body> <div id="App"></div> ...
Using webpack, you can bundle your component: $ webpack This will create our output file in build directory. Open the HTML page in a browser to see component in action
Cryptography is the science of using mathematical constructs (codes) to make communication secure. The field of cryptography is a subset of the field of Information Security. There are many cryptographic operations possible; some best known examples are: Encryption : transforming a plaintext mes...
Detailed instructions on getting mono set up or installed.
There are two operators for pointers: Address-of operator (&): Returns the memory address of its operand. Contents-of (Dereference) operator(*): Returns the value of the variable located at the address specified by its operator. int var = 20; int *ptr; ptr = &var; cout << var &...
Create a new ASP.Net Project: Select the empty template: Add two new folders: App and Scripts in the root folder: Add npm configuration file in the root folder: { "version": "1.0.0", "name": "phaser.js.environment.setup", "priva...
Creating a List Node class listNode { public: int data; listNode *next; listNode(int val):data(val),next(NULL){} }; Creating List class class List { public: listNode *head; List():head(NULL){} void insertAtBegin(int val); void insertAtEnd(int val)...
To find the largest items in a collection, heapq module has a function called nlargest, we pass it two arguments, the first one is the number of items that we want to retrieve, the second one is the collection name: import heapq numbers = [1, 4, 2, 100, 20, 50, 32, 200, 150, 8] print(heapq.nl...
The most interesting property of a heap is that its smallest element is always the first element: heap[0] import heapq numbers = [10, 4, 2, 100, 20, 50, 32, 200, 150, 8] heapq.heapify(numbers) print(numbers) # Output: [2, 4, 10, 100, 8, 50, 32, 200, 150, 20] heapq.heappop(numbers) # 2...
Options have a flatMap method. This means they can be used in a for comprehension. In this way we can lift regular functions to work on Options without having to redefine them. val firstOption: Option[Int] = Option(1) val secondOption: Option[Int] = Option(2) val myResult = for { firstValue ...

Page 344 of 475