摘要：map<vector<int>::iterator,int*>m; vector<int>vec{ 1,4,31,23,1 }; less<int>s; auto iter = vec.begin(); while (iter != vec.end()) { m[iter] = &(*iter); 阅读全文

摘要：#include <iostream> #include<algorithm> #include<vector> using namespace std; void swap(int& a, int& b) { int t = a; a = b; b = t; } void quicksort(ve 阅读全文

摘要：1. First, write a simple program called null.c that creates a pointer to an integer, sets it to NULL, and then tries to dereference it. Compile this i 阅读全文

摘要：2. Now, run free, perhaps using some of the arguments that might be useful (e.g., -m, to display memory totals in megabytes). How much memory is in yo 阅读全文

摘要：1. Compute the solutions for simulations with 3 jobs and random seeds of 1, 2, and 3. siuwhat@siuwhat-PC:~/Desktop/HW-Lottery$ ./lottery.py -j 3 -s 1 阅读全文