0
I have implemented Dijkstra's Algorithm in C, using arrays instead of any structs.
Here is my implementation:
#include <stdio.h>
#include <stdlib.h>
int G[20][20] , distance[20] , inSet[20] , q[20] , parent[20] ;
void print( int V )
{
int i ;
for ( i = 0 ; i < V ; i++ )
printf("i = %d pare...
I am new to C++ and programming in general. After reading through my first book, I decided to take on some programming exercises and test what I learned. The exercise is phrased as follows:
"Find Cost of Tile to Cover W x H Floor - Calculate the total cost of tile it would take to cover a floor...
Meme: BTW
Originator: [attributed to] Malachi, Mat's Mug and Others
Cultural Height: The 2nd Monitor
Background: The many ways of backronymizing btw led to the introduction of the BTW enum:
public enum BTW{
Bananas,
Bring,
Normal,
Waffles,
Wall,
Web,
Win,
Woods,
Wo...
I have a piece of code that searches for XMLs in given folders, delete the ones older than X, zip the ones older than Y and delete zips older than X. It works perfectly but I have a terrible feeling that this is very inefficient code. I am a temp at a networking company and this is one of the fir...
I am currently learning javascript and I attempted to make a Person class (note - this was part of a practice exercise, so some of the design decisions may have been due to the requirements).
Specifically, I am looking for feedback on:
-Usage of prototypes (i.e. from my understanding, prototy...
This is my first program in Python and first time I'm writing in dynamically typed language. I have substituted real detectPeaks function with a simple placeholer. I'm aware of several problems with this program.
I still don't quite know how to 'live with' python scoping. Hence qFix function. I ...
That question title isn't intended to sound demanding, I'm just unsure how to word it better.
So a while ago, I received an email from Robert Cartaino titled Stack Overflow — You're killing it:
It's not often I get to reach out and thank someone individually for their contribution to a site,...
I've seen a blog post with Jon Skeet on it holding a painting of a unicorn with the title "What happens if you reach 200k reputation?"
The script is intended to return an array with texts containing specific words in English and the equivalent texts in Polish from EUR-Lex - a website with EU documents.
The script downloads the page which address is specified by the passed variable. Then the page
http://eur-lex.europa.eu/search...
Maybe its a smaller point, but i think logging things slows down performance (ie the "print i").
I need to compare two strings containing words separated by a dash.
If words are present in both string the script consider the strings as the same, this works with any order ex:
WORLD-FRANCE-PARIS same
FRANCE-PARIS-WORLD same
or
WORLD-FRANCE-PARIS same
PARIS-WORLD-FRANCE same
or
WORLD-...
If we break the problem down, it makes the problem easier.
Lets start by simply finding the intersection of two arrays. The fastest way to find an intersection is using sets, but since we are talking about Javascript here, we are going to use objects. Hence, our steps become:
Create a curren...
