I am new to C++. Coming from Python. I am trying to implement a Linked list in c++. Blow is a code to remove duplicate element from an unsorted linked list
/*
Given an unsorted linked list remove duplicate elements from it.
1> Brute Force: 2 for loops, check for duplicates
*/
#include<bits/std...
This following code executes correctly.I was wondering if there are better ways to write this code instead of using the conditions in main function
def tester(givenstring= "Too short"):
print(givenstring)
def main():
while True:
data = raw_input("Write something (quit ends): ")
...
Just finished writing this function in C# that searches a file on disk for a specific substring, and returns the index of either the first character, or last character of the first occurrence, if it's found in the file, or -1 otherwise.
It works fine under all the conditions upon which I've test...
for (var i=0; i < this.model.rating; i++) {
console.log("One more star")
}
I'd love to use map, or an iterations pattens similar to python's xrange() but can't find anything of that sort in JS.
I know about underscore.js but i'd rather first try some of the new ES6 goodies.
I have written my implementation of prims algoritm. Could anyone comment what could be done better and if I do any mistakes.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<pair<int, int>, int> Edge; //a, b, length
// A---------B
// length
vector<
I'm studying design patterns and to demonstrate a singleton, I've implemented a primitive database connection pool.
ConnectionPool.java
package com.levent.connpool;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.SQLException;
public class ConnectionPool {
priv...
I've created a voting system that's similar to Stack Exchange's in a Ruby on Rails web app. It's working great - as far as I can tell, all the edge cases are caught. This is the action to cast a vote.
There are some conditions I've had to satisfy:
must not allow duplicate voting, even from co...
I need to code the Sylvester sequence in Python. The formula for the sequence is defined as
$$s_n = 1 + \prod_{i=0}^{n-1}s_i$$
However, I am having too much trouble writing this code in Python. Does anyone have a suggestion on how to do it?
I want to write a code to calculate the Sylvester sequence, which is defined as $$s_n = s_{n-1}(s_{n-1}-1)+1$$, where $$s_0=2.$$
def sylvester_term(n):
""" Returns the maximum number of we will consider in a wps of dimension n
>>> sylvester_term(2)
7
>>> sylvester_term(3)
43...
From the related questions here, I've found this and this answers, both of which suggest Replacing Conditional with Polymorphism, are probably what I'm looking for. However, I'm not sure if polymorphism would be a good choice for my particular case. Below are the relevant code snippets (sorry the...
Well, I guess putting myself out there, I'm ready to accept some rather critical analyses from the StackExchange community.
I'm simply looking for guidance? I'm wanting to know if I'm on the right track with my project. I've been working on this game for a couple weeks now as a purely personal ...
In javascript, same functions can be written in different ways such as following. which way is best for unit testing scenarios
// 1st way ============
var app = {};
app.name = "abc"
app.init = function () {
return "test";
};
// 2nd way ============
function app() {
this.name = "abc";
...
In my Java 8 app there is a code fragment, which repeats in multiple classes:
for (int i = 0; i < unprocessedEvents.size(); i += itemsPerCore) {
int indexFrom = i;
upperIndex += itemsPerCore;
int toIndex = upperIndex;
// all remaining items will be processed in the last thread
...
I am a student of mechanical engineering and one of our subject is Computer fundamental.so this is our simple project to make calculator .i tried but not succeeded .. i got some errors. help me.I share errors .
I've come from a PHP background and I'm really trying to unlearn the bad habits I acquired from not doing things properly with PHP through my own lack of understanding..
I'm looking to advance my understanding and implementation of OOP principles. Below I have a simple email notifier class. I ha...
I am trying to develop a way of mixing the code of a cash machine dispensing, I'll explain,
Assuming we want to make a cash withdrawal of 1000 and we have through 200 100 50 20 then the logic is to give 5 through 200 but I am a mixture or it gives me 5 200, or 10 100, or 4 100 and 3 200 ....
N...
I'm wondering if using a Singleton for a storage of discounts is the right way to go. This is because I will be looping over all added discounts in another class.
client code
// Dynamically add new Discounts
$collection = DiscountCollection::getInstance();
$collection->add(new TenPercentDiscoun...
I'm looking for a review of my code. The following functions/routines are an automation of an end of day receipt emailing process that formerly would take up to an hour, but now takes less than a minute.
Things to note: I changed the name of some of a variable or two in order to protect the ide...
I'm wondering how some users handle huge amounts of code. There's a vba question out there right now that I would really like to review. However, as stated in the question - it's 1400 lines.
I know that doesn't make it a bad question, or off-topic or bad code, and I'm not complaining about it.
...I am trying to write a program that will compute the average and sort a certain number of grades a user inputs. I am working with dynamic array allocation. I feel confident in my code, but Xcode is giving me an error in my sort function. Here is my full program:
// This program demonstrates the...
Problem : Optimise this c# code for performance
What does it do?
Takes a selection of numbers between 1 to 9 which could be
1,2,3,4,5,6,7,8,9 or 1,2,4 or 4,5,8,9 etc
Works our every possible combination and compares them to a dice roll of two dice
e.g. If the dice roll is 7 then can it be fo...
I'm new to programming, and I would appreciate any constructive criticism on my code and if there may be a more efficient way to code this. Thank you in adcance
import java.util.Scanner;
/**
* This program will decide what mechanism a reaction will undergo given information about the reactants....
I am currently working on a method to have custom control over the way my classes are serialized. All serializable classes have an interface and they all serialize themselves to an intermediate class which is then serialized by the serializer.
readonly XmlSerializer serializer = new XmlSerializ...
I am new to recursion and searching algorithms and am trying to implement a maze searching program using DFS. I have tried troubleshooting the issue, but there seems to be an error with my code. Any guidance would be appreciated.
I have a graph class for loading in the maze from an external text...
I try to write a function which calculates the check digit for shipping label based on the algorithm provided by GS1
http://www.gs1.org/how-calculate-check-digit-manually
Version 1: my first try
public static int GetGTINCheckDigitV1(string code)
{
int sum = 0;
for (int i = 0; i < code....
This code is part of a larger code that generates an Arithmetic Quiz, although the code I have show below just saves the score that the user got on the test and their name. When saving the code it checks if the user has taken the quiz before. If the user has taken the quiz before it saves it as '...
My code works with small binary tree but with big binary tree with nodes = 10000 I'm not getting any output for too long
For small binary tree I'm always getting correct answer and fast
How can i make my program faster for big binary tree
(x, y) is a neighbour pair when the depth of x and y is...
Here is a non-predictive recursive descent parser I wrote for the following grammar:
E : E1 '*' E
| E1 '/' E
| E1 '+' E
| E1 '-' E
| E1
;
E1 : NUM
| '(' E ')'
;
It can be run against the token stream
func main() {
// (m) * (m / (m))
valid := Parse([]Token{
{Va...
