rmandhan

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

Stores data elements based on an sequential, most commonly 0 based, index.
Based on tuples from set theory.

	void quick_sort(int a[], int n) {
	// 종료 조건
	if (n < 2) {
	return;
	}

	// pivot 기준으로 좌우 이동
	int pivot = a[n-1]; // 마지막 요소를 pivot으로 설정
	int left = -1;
	int right = n-1;

	/* Merge sort in C */
	#include<stdio.h>
	#include<stdlib.h>

	// Function to Merge Arrays L and R into A.
	// lefCount = number of elements in L
	// rightCount = number of elements in R.
	void Merge(int A,int L,int leftCount,int *R,int rightCount) {
	int i,j,k;