0
want to print 1 2 3 4 5 as a binary number
class binary
{
public static void main(String args[])
{
for(int i=1;i<=5;i++)
{
int k;
for(int j=i;j>0;j--)
{
k=j%2;
System.out....
There's two sides to this review:
Security & Style.
Style:
Directly return $hash instead of assigning it.
The string concatenation can be improved
into:
public static function makeSafe($password)
{
$salt = "mySalt";
return hash("sha256", "{$salt}.{$password}");
}
Security:
W...
6
0
When should I manually create a destructor?
Almost never.
Typically one only creates a destructor when your class is holding on to some expensive unmanaged resource that must be cleaned up when the object goes away. It is better to use the disposable pattern to ensure that the resource is...
For example:
public class Person
{
public Person()
{
}
~Person()
{
}
}
When should I manually create a destructor?
When have you needed to create a destructor?
Discussion on question by Sam Swift: …
Imported from a comment discussion on codereview.stackexchange...
0
So, pretty self explanatory. This provides (my own) implementation of ToBase64String and FromBase64String (since the .NET implementations suck), and a ToBase32String (since .NET hasn't one).
/// <summary>
/// Provides extensions to convert certain objects to certain other objects.
/// </summary>...
1
1
I've just finished working on a multi-threaded network queue and was wondering where I could improve, I'm a little rusty when it comes to waits and such.
The idea is to queue up network actions whilst waiting for a form of network internet connectivity. I also added the ability to prioritize whi...
0
So, pretty self explanatory. This provides (my own) implementation of ToBase64String and FromBase64String (since the .NET implementations suck), and a ToBase32String (since .NET hasn't one).
/// <summary>
/// Provides extensions to convert certain objects to certain other objects.
/// </summary>...
79
Recently, I wrote a simple program to solve the change-making problem. Rather than the tabular dynamic programming solution (described in the link), I tried to write a solution that uses memoization.
usd = [25, 10, 5, 1]
def make_change(W, denoms=usd):
"""
Solves the change-making prob...
Given a directed acyclic graph with N nodes and M edges having positive weights, increase the edge weights of some edges such that the total weight (sum of edge weights on the route) of any route from 1 node to N node is same and minimum. Following are the constraints:
The total weight of all t...
