rcanepa

#include <iostream>
#include <stdlib.h>
#include <time.h>


int binary_search(int list[], int length, int to_be_found);
int recursive_binary_search(int list[], int to_be_found, int p, int r);

int main()
{

rcanepa

import random


def merge(left_arr, right_arr):
    """
    Receives two ordered lists and returns a ordered
    list created from the merge of the other two.
    :param left_arr: ordered list
    :param right_arr: ordered list
    :return: ordered list created from the merge of left_arr and right_arr

rcanepa

def insertion_sort(arr):
    for idx, number in enumerate(arr):
        current = idx
        previous = idx - 1
        if idx > 0:
            while arr[current] < arr[previous] and (previous >= 0):
                temp = arr[current]
                arr[current] = arr[previous]
                arr[previous] = temp
                current = previous

rcanepa

#include <iostream>
#include <stdlib.h>


void selection_sort(int *list, int list_length);

int main()
{
    int list_length = 30;
    int list[list_length];

rcanepa

#include <iostream>
#include <stdlib.h>

void insertion_sort(int *list, int lenght);

int main(int argc, char const *argv[])
{
    int list_length = 30;
    int list[list_length];
    srand(time(NULL));

rcanepa

#include <iostream>
#include <stdlib.h>

/*
This implementation could be improved using
sentinels.
*/


void merge_sort(int *list, int p, int r);

rcanepa

#include <iostream>
#include <stdlib.h>

void quick_sort(int *list, int p, int r);

int main(int argc, char const *argv[])
{
    int n = 11;
    int list[n];
    srand(time(NULL));

rcanepa

/*
Short list of macros and templates from
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=standardTemplateLibrary
*/
typedef vector<int> vi; 
typedef vector<vi> vvi; 
typedef pair<int,int> ii; 
#define sz(a) int((a).size()) 
#define pb push_back 
#defile all(c) (c).begin(),(c).end() 

rcanepa

Rich Hickey on becoming a better developer

Rich Hickey • 3 years ago

Sorry, I have to disagree with the entire premise here.

A wide variety of experiences might lead to well-roundedness, but not to greatness, nor even goodness. By constantly switching from one thing to another you are always reaching above your comfort zone, yes, but doing so by resetting your skill and knowledge level to zero.

Mastery comes from a combination of at least several of the following:

rcanepa

(ns foobar.components
  (:require [com.stuartsierra.component :as component]
            [compojure.api.sweet :refer :all]))

(defmethod compojure.api.meta/restructure-param :components
  [_ components acc]
  (update-in acc [:letks] into [components `(::components ~'+compojure-api-request+)]))

(defn wrap-components [handler components]
  (fn [req]