srinathgs

Golang Job Queue

A running example of the code from:

• http://marcio.io/2015/07/handling-1-million-requests-per-minute-with-golang
• http://nesv.github.io/golang/2014/02/25/worker-queues-in-go.html

Step 1

Small refactorings made to original code:

srinathgs

Peter Thiel's CS183: Startup - Class 1 Notes Essay

Here is an essay version of my class notes from Class 1 of CS183: Startup. Errors and omissions are my own. Credit for good stuff is Peter’s entirely.

CS183: Startup—Notes Essay—The Challenge of the Future

Purpose and Preamble

srinathgs

## The quick-and-nasty CVE-2013-0156 Heroku inspector!
## Originally brought to you by @elliottkember with changes by @markpundsack @ Heroku
## Download and run using:
## ruby heroku-CVE-2013-0156.rb
 
`heroku list`.split("\n").each do |app|
  app = app.strip
  
  # Some "heroku apps" lines have === formatting for grouping. They're not apps.
  next if app[0..2] == "==="

srinathgs

#include <iostream>
#include <vector>
using namespace std;

int main()
{
    vector<int> digits;
    int carry;
    digits.push_back(1);
    //Just Old School Multiplication.

srinathgs

//Project Euler Problem 14. Using Collatz's conjecture.
//http://projecteuler.net/problem=14

#include <iostream>
#include <map>
using namespace std;

map<long, long> table; //memoization

int seqLen(long num){

srinathgs

#include <iostream>
#include <map>
#include <limits>
#include <set>
#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

srinathgs

#include <iostream>
#include <vector>

using namespace std;

void sort(vector<int> &arr);
int main()
{
    int n,k;
    cin>>n;

srinathgs

#include <iostream>
#include <vector>
#include <cstdlib>
#include <iterator>
#include <algorithm>
using namespace std;

template< typename comparable> void insertionSort(vector<comparable> &a);
template< typename comparable> void shellSort(vector<comparable> &a);
template <typename comparable> void mergeSort(vector<comparable> &a);

srinathgs

#include <iostream>
#include <vector>
#include <sstream>

using namespace std;

int main()
{
    string buf;
    int n;

srinathgs

#include <iostream>
#include <vector>
#include <iomanip>
#include <cstdio>
using namespace std;
double average(vector<int>&tripFares){
    double sum = 0;
    for(vector<int>::iterator i = tripFares.begin();i!=tripFares.end();i++){
        sum+= *i;
    }