I recently started to do some of the exercises in CodeChef and I did the TurboSort. It works fine with smaller arrays but can't pass some of the test due to the fact it's \$O(n^2)\$, so I need faster way to sort them.
import java.util.Scanner;
public class TurboSort {
public static void m...
The newsletter suggested I try to answer this, so here is my attempt:
This looks like a lot of repeated code here. I don't think this can be shortened really, but I would create a function to do the conversion in:
switch(x)
{
case '"': cont.push_back('"'); break;
case '\\': con...
So, I just did this brainfuck interpreter.
I have some concern, like the "updateValue" function, I was trying to follow the functional paradigm, but I wonder if I could use another approach or something.
my parsing function seems overly complicated, the '[' case seems complicated
Any other com...
I'm trying to design the classes for the Wheel of Fortune game in java. Below diagram represents the classes and the interaction between them.
.
Below is the partial implementation of it. I appreciate some feedback on my design and approach. I'm mainly interested in classes and their dependenc...
The simple-to use, but generic timeout class to be used watching network connections, user input, filesystem events, and is intended to have a very simple interface specific to our use cases.
Intended steps to use:
Construct
Activate
Potentially react to a timeout, deactivate
Re-activate
Destr...
If someone can review this C#/Linq grouping code snippet please.
I have a list of Options. From that list
first I want to get only Drink (the where clause)
Then I want to group them by their SortOrder(range of 100)
I can stop there and loop through the items and create checkboxes for each ite...
In java I usually make a for-loop like following:
for (int i = 0; i < max; i++) {
something
}
But recently a colleague typed it so:
for (int i = 0; i < max; ++i) {
something
}
He said the latter would be faster. Is that true?
For a Pascal, Delphi, Pascal Script related question: Pascal / Delphi / Pascal Script tags
What about create a Free Pascal tag?
Object Free Pascal (as in Free Pascal compiler), as far as I know, is given by the directive:
{$mode objfpc}{$H+}
The compiler supports Delphi as well, but not co...
I have an application that provides the user the ability to backup the local SQLite database to another location. I then provide the ability to restore the backup database and overwrite the current database with the backup copy. In my restore command, I make a backup of the database file, which...
I have this code which mimics a rugby match. You select a player by clicking the div (turns green), move it, and click to release( returns to default color). There is a bug, the mouse can move too fast, thus leaving the div behind. I am also trying to make it OO, but I'm having problems as you ca...
The first line of the input contains the total number of stack operations N, 0 < N ≤ 100000. Each of the next N lines contains a description of a stack operation, either in the form PUSH A B (meaning to push B into stack A), or in the form POP A (meaning to pop an element from stack A), where A i...
I'm writing a C (c99) library that operates on strings. I'm having a design problem writing functions that will perform in different modes.
For example; the Find function can search for:
the first, last, n-th element
different letter case
return position before or after the found element
sear...
What interesting uses of MathJax are there, other than mathematical typesetting, that might be useful for Code Review?
I have sample graphs like the following(Un-directed un-weighted cyclic graphs). My goal is to find shortest path between a given source and destination.
film--->[language, film_actor, film_category, inventory]
film_actor--->[actor, film]
store--->[customer, inventory, staff, address]
payment--->...
This is the code I have:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct island{
char *name;
struct island *nextIsland;
} island;
void printIslands(island *i){
printf("%s\n",i->name);
if(i->nextIsland != NULL){
printIslands(i->nextIsland);
...
Let's look at tableView:cellForRowAtIndexPath:. This needs to be abstracted quite a bit more.
First of all, CustomTableViewCell is a bad name for a class. Every table view cell is custom. We need to spend more time working on our cell subclass, because the name is just the start.
Let's chang...
Can anyone kindly help me to improve it? Many thanks.
def comp( nums,i,j,exps,op):
nums0=[];
for x in range(0,len(nums)):
if not (x==i or x==j):
nums0.append(nums[x])
if(op=='+'):
tmp = nums[i]+nums[j];
elif(op=='*'):
tmp = nums[i]*nums[j];
elif(op=='-'):
tmp = nums[i]-n...
I am trying to implement A* search on a grid in MATLAB. I am currently using a priority queue class I found here, but it's a bit slow. I tried to write this simple priority queue class in MATLAB:
classdef PQ < handle
properties
nElements;
priorityList;
valueList;
...
