This is my attempt at Conway's game of life. It works! It's the most complicated program I've made to date. Though I'm sure it's pretty poorly done. Any idea's on how I can improve on it?
#include <iostream>
#include <cstdlib>
#include <algorithm>
const int gridsize = 75; //Making this a globa...
Meme: TS | RSA
Originator: SimonAndréForsberg (TS), rolfl (RSA)
Cultural Height: star-power
Background: The 2nd Monitor is quite a star-happy chatroom. How many of you know that there's only a number of times you can "star" a chat post - a star cap (like the rep cap and the vote cap, a star ca...
Two major suggestions:
First, lets try speeding everything up by taking advantage of the nature of Conway's game of life and the way C++ handles pointers. When you evaluate Conway's game of life it's a two part process, first you copy all of the entries into a new array, then you do your computa...
One major thing: do not pass C-arrays to functions as they will decay to a pointer. In C++, you should use storage containers instead of these arrays, which are safer and more intuitive for such uses.
You may consider an std::vector of bools. In this case, it would have to be 2D:
std::vector<...
You have several options for follow-ups:
If one of the answers gives you good advice with clear directions for improving your code, just accept the best answer and upvote any other answers you feel were helpful. The checkmark that you confer is the best way to show appreciation on this site, a...
Please be brutal, and judge my code as if it was written at a top 3 tech company, straight out of college. (The method signature, and input parameter is given by the problem, so don't worry about that)
Worst case complexity: \$O(n^2)\$
Space complexity: \$O(n)\$
Time it took me to solve this:
...
From Wikipedia:
Insertion sort iterates, consuming one input element each repetition,
and growing a sorted output list. Each iteration, insertion sort
removes one element from the input data, finds the location it belongs
within the sorted list, and inserts it there. It repeats until no...
Currently I'm using a binary search algorithm to search an index of a tree that represents an XML file.
Can I use heuristics to improve the search? What can I do to improve this search function?
Here is my search function, in php, so far: http://pastebin.com/5aaTkpt1
The reason I haven't paste...
it is my first post just want to ask how can I improve the string RecvData() can someone give me hand in how to improve it my code ?
std::string Socket::RecvData() {
std::string strBuffer;
do{
char buffer;
int recvInt = recv(s_, &buffer, 1, 0);
if (recvInt == INVA...