- 博客(13)
- 收藏
- 关注
原创 Emacs 学习笔记 2 配置文件
和Vim一样,Emacs也是一款自由度很高的编辑器。Vim的配置文件是~/.vimrc,Emacs的配置文件是~/.emacs。考察配置文件是否其作用的最好方法就是修改配色1.基本外观修改下载color-theme.tar,我将其下载到~/Documents/Emacs/路径下,解压,进入文件夹,复制color-theme.el和themes/到~/.emacs.d目录下然后M
2012-08-04 01:45:28 629
原创 Emacs 学习笔记1 基本操作(和Vim 命令对照)
我决定从今天开始学习Emacs。因为我对Vim的命令还是比较熟悉的,所以打算在这个学习笔记里用Vim的命令进行翻译。很多操作用人类语言表示出来远不如Vim快捷键来得直接。这样即是快速学习Emacs,也是对Vim加固一下。C-v C-fM-v C-bC-l 整幅图出现在中央(don't know its Vim counterpart)C-f l
2012-07-30 09:54:12 939
原创 Programming Question-6
1.Two-Sum ProblemThe goal of this problem is to implement a variant of the 2-SUM algorithm (covered in the Week 5 lecture on hash table applications)The file contains 500,000 positive integers
2012-07-26 14:48:31 3210 1
原创 Programming Question-5-Dijkstra Algorithm via Min-Heap (including Notes)
In this programming problem you'll code up Dijkstra's shortest-path algorithm. Download the text file here. (Right click and save link as). The file contains an adjacency list representation of
2012-07-19 22:41:41 2152
原创 Programming Question-4-Strongly Connected Components Problem through DFS
The file contains the edges of a directed graph. Vertices are labeled as positive integers from 1 to 875714. Every row indicates an edge, the vertex label in first column is the tail and the vertex la
2012-07-13 11:37:04 2790
原创 Programming Question-3-Contraction Algorithm
The file contains the adjacency list representation of a simple undirected graph. There are 200 vertices labeled 1 to 200. The first column in the file represents the vertex label, and the particula
2012-07-06 21:18:19 1922
原创 Programming Question-1-Inversion Numbers
#include#include#includeconst char INFILE[]="IntegerArray.txt"; long RTN_LNUM(){ FILE*fp = fopen(INFILE,"r"); long LNUM=0; char ch[100]; while (fgets(ch,100,fp)) LNUM++; fclose(fp);
2012-06-22 09:17:13 857 2
转载 Algorithm Study Notes
0.Master Method 时时勤拂拭Master Theorem Let a ³ 1 and b > 1 be constants, let f(n) be a function, and let T(n) be defined as the nonnegative integers by the recurrenceT(n) = aT(n/b) + f(n),w
2012-05-16 16:35:08 527
原创 Merge Sort [Advanced] C程序 不同数据规模下测速
#includeconst char FILENAME[] = "to be sorted.txt";const char OUTFILE[] = "performances of merge sort algorithm.txt";#include#include#includevoid create_input(FILE*fp,long N){ long i; for (i
2012-05-10 16:21:40 524
原创 Merge Sort [Basic] C程序 实现排序功能
#includeconst char FILENAME[] = "to be sorted.txt";#include#includevoid create_input(FILE*fp,short N){ short i; srand(time(NULL)); for (i=0;i<N;i++) fprintf(fp,"%d\n",rand());}void Merge
2012-05-10 14:43:15 478
原创 C codes for VirginiaJ
#includeconst char OUTFILE1[] = "LongestLasing.csv";const char OUTFILE2[] = "AddUp.csv";const char OUTFILE3[] = "AllStocksAllSeasons.csv";#define SIZE 10000#include#includestruct NODE{ char
2012-05-03 13:18:57 416
原创 Qualification Round Africa 2010 Problem B. Reverse Words
/* Qualification Round Africa 2010 Problem B. Reverse Words */#includeconst char FILE_NAME[] = "B-large-practice.in";const char OUT_FILE_NAME[] = "B-large-practice.out";#define NEXTLINE fgets(l
2012-04-19 20:55:01 515
原创 Qualification Round Africa 2010 Problem A. Store Credit
/* Qualification Round Africa 2010 Problem A. Store Credit */#includeconst char FILE_NAME[] = "A-large-practice.in";const char OUT_FILE_NAME[] = "A-large-practice.out";#define NEXTLINE fgets(li
2012-04-18 20:18:05 492
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人