N02870941

package main

import "fmt"
import "strconv"

//------------------------------------------------------------------------------

type Node struct {

  data  int

N02870941

/**
 * Sorts an array of values. An optional 2 parameter comparator function is available
 * to specify ordering. If no comparator is supplied, then the values will be sorted
 * based on their primitive values via the Object.prototype.valueOf() function.
 */
function sort(array, comparator = (a, b) => a.valueOf() - b.valueOf()) {
  quicksort(array, 0, array.length-1, comparator)
}

//------------------------------------------------------------------------------

N02870941

# README:
#
# Run this script as follows:
#
# ./video.sh urls.txt videos
#
#  Where urls.txt is a list of RTSP links
# and videos is the directory that you would
# like to save the downloaded videos to. If
# the designated directory does not exist, it

N02870941

import java.util.stream.IntStream;

class Threads {

  public static void main(String... args) {

    IntStream
    .range(0, 10)
    .mapToObj(i -> new Thread(() -> System.out.println(Thread.currentThread().getName())))
    .forEach(thread -> thread.start());

N02870941

import java.util.concurrent.ThreadLocalRandom;
import java.util.Arrays;

/**
 * Quicksort implementation that counts that
 * number of comparisons required to perform the sort.
 *
 * @author Jabari Dash
 */
public class QuickSort {

N02870941

public class ToBinary {

  /**
   * Converts a positive integer to binary.
   *
   * @param decimal Decimal number.
   * @return Binary string. 
   */
  public static String binary(int decimal) {

N02870941

import math
import random

#-------------------------------------------------------------------------------

'''
Default comparator that sorts
numeric values in their natural order.
'''
def comparator(one, two):

N02870941

import java.util.List;
import java.util.ArrayList;


import java.util.Arrays;
import java.util.Objects;
import java.util.stream.Collectors;

public class Contains {

N02870941

#!/usr/lib/python
# -*- coding: utf-8 -*-
#
#       This is a re-implementation of Python's timsort in Python
#       itself. This is purely for learning purposes. :)
#       References: [
#           https://en.wikipedia.org/wiki/Timsort,
#           http://wiki.c2.com/?TimSort
#       ]
#

N02870941

var detectBackOrForward = function(onBack, onForward) {
  hashHistory = [window.location.hash];
  historyLength = window.history.length;

  return function() {
    var hash = window.location.hash, length = window.history.length;
    if (hashHistory.length && historyLength == length) {
      if (hashHistory[hashHistory.length - 2] == hash) {
        hashHistory = hashHistory.slice(0, -1);
        onBack();