Cacher is the code snippet organizer for pro developers

int main(void)
{
	printf("\n");
	wprintf(L"%s", "\U0000256C");//╬"); // Unicode
	
	return 0;
}

int main()
{
  printf("\xC2\xAE\n"); // UTF
}

//
// Created by Mace Foster on 5/14/16.
//

#include <stdio.h>
#include <locale.h>
#include <string.h>
#include <wchar.h>
#include <stdlib.h>

int main(void)
{
    setlocale(LC_ALL, "");
    char *mychar = "\xE2\x94\x8f";
    char *nextchar = "\xE2\x94\x81\xE2\x94\x81\xE2\x94\x81";
    char *tl = "\u250F";
    char *hb = "\u2501\u2501\u2501";

    wchar_t uchar[] = {U'\U0000250F', U'\U00002501'};

    //char *mychar = "ABCDEfGHIJKLmNOP";
    printf("%s%s", mychar, nextchar);
    wprintf(L"%lc", uchar[0]);
    printf("%s%s", tl, hb );
    return 0;
}
//┏
//BOX DRAWINGS HEAVY DOWN AND RIGHT
//Unicode: U+250F, UTF-8: E2 94 8F
//━
//BOX DRAWINGS HEAVY HORIZONTAL
//Unicode: U+2501, UTF-8: \xE2\x94\x81

# Use Gists to store entire functions
class QuickSort
 
  def self.sort!(keys)
    quick(keys,0,keys.size-1)
  end
 
  private
 
  def self.quick(keys, left, right)
    if left < right
      pivot = partition(keys, left, right)
      quick(keys, left, pivot-1)
      quick(keys, pivot+1, right)
    end
    keys
  end
 
  def self.partition(keys, left, right)
    x = keys[right]
    i = left-1
    for j in left..right-1
      if keys[j] <= x
        i += 1
        keys[i], keys[j] = keys[j], keys[i]
      end
    end
    keys[i+1], keys[right] = keys[right], keys[i+1]
    i+1
  end
 
end