I'm studying Angular and want to develop my own notification alert. This is what I done, I like it and it's working like a charm but I think that it can be improved:
Do I need to use it in conduction with a service? If yes, how?
It will be better if it become an E (element)?
I needed to put sty...
Would anyone be so kind as to review my code for memory, the card game? Any advice would help me out a bunch!
import java.util.*;
public class Cards {
public boolean gameInProgress = true;
public void shuffleCards() {
Scanner userInput = new Scanner(System.in);
List cardList = new Li...
Preliminaries
Your compiler should have warned you that in main(), you never use list2. You do compile with warnings turned on, I hope?
Usually, the first node of a linked list is called the head. "Root" usually refers to the top of a tree.
mergeList() and findMid() are helper functions, whi...
A simple javascript 'fizz buzz' solution based on a codecademy exercise. I refactored it down a few lines after seeing these: http://rosettacode.org/wiki/FizzBuzz#Alternative_version_.28one-liner.29
I wanted to post here and see what else I can learn from this basic exercise. Thank You.
for ...
Can anyone tell me how to enable logging of all SQL executed by Postgres (8.3)? Thanks!
Edited (more info)
I changed these lines :
log_directory = 'pg_log'
log_filename = 'postgresql-%Y-%m-%d_%H%M%S.log'
log_statement = 'all'
And restart postgres service... But no log was created...
...
I've written code that grabs google fonts and adds them as an HTML body class. The code works fine but in my IDE, I am getting an undefined variable message. I can see why as the variable is outside the foreach loop.
$fontstring = implode(' ', $families);
foreach ($families as $fontstring)...
In keeping with using FizzBuzz as an introduction to a language, I present FizzBuzz with a Fortran95 twist:
For multiples of 3, print Fort, and for 5's multiples print Ran. For multiples of both, print FortRan.
Looking especially for style and common practice criticisms. A hint on how to left-j...
Cousins are nodes at the same level of the tree, with different parents.
They don't have to share the same grandparent.
My solution depends on having a binary search tree with unique elements.
This code is faster than writing a special find(Node *) that returns the node's level and parent, beca...
Some background:
I'm writing a number of classes that ensure user input is properly validated, and is rejected if it does not conform to expected types (there's also some extra options such as setting bounds and finite sets that the values can come from). There are a number of basic types (Integ...
A recent question inspired me to implement a Fraction class. The OP's code was written in vb.net, and I had already implemented it in c#, so I decided to write this one in vba, because I like writing tools for the poor souls that still have to deal with that language myself.
I really wanted to b...
A recent question inspired me to implement a Fraction class. The OP's code was written in vb.net, and I had already implemented it in c#, so I decided to write this one in vba, because I like writing tools for the poor souls that still have to deal with that language myself.
I really wanted to b...
To understand the concept, I implemented the stack operations using linked list. Please review the code and tell me your suggestions.
Time complexity of push O(n)
Time complexity of Pop O(n)
Node . java
public class Node {
public int data;
public Node next;
public Node(int data) {
this.d...
The following question was taken from Absolute Java 5th ed. by Walter Savitch:
Write a program that outputs the number of hours, minutes, and seconds that corresponds to 50,391 total seconds. The output should be 13 hours, 59 minutes, and 51 seconds. Test your program with a different number...
Given f(n) = 1+x+x^2+x^3+……+x^n and we know that computer cost more time when multiply than add two numbers, how can we work out the result with greater efficiency? Blow is my solution, is there any good ideas?
#include <iostream>
using namespace std;
double powerWithIntExponent(double base, i...
e1.c
#include<stdio.h>
#include "common.h"
int main(){
printf("The add is : %d ",add(2,2,1));
return 0;
}
e2.c
#include<stdio.h>
#include "common.h"
int main(){
printf("The add is : %d ",add(2,2,2));
return 0;
}
common.h
#ifndef COMMON_HEADER
#define COMMON_HEADER
int add(...
A toy function meant to illustrate that there are simple things can only be described recursively.
willUseGPL = (party) ->
return no if party.hatesFreedom
for party in party.downstream
return no unless willUseGPL party
yes
There is a test of OO knowledge called Iffy Tractor. The task is to refactor the code and make it as much flexible as possible for the future modifications.
I have placed the code here: http://pastebin.com/s3ABaBqh
It was taken from here: http://www.benstopford.com/2011/05/11/the-iffy-tractor-c...
