computer-science

I can't seem to find a clear explanation as to what the difference is between these two. I'd also like to point out that I don't really understand the difference between literals and values either. Do boolean literals use the Boolean object? dtech A literal is a value you literally provide in your script, so they are fixed. A value is "a piece of data". So a literal is a value, but not all values are literals. Example: 1; // 1 is a literal var x = 2; // x takes the value of the literal 2 x = x + 3; // Adds the value of the literal 3 to x. x now has the value 5, but 5 is not a literal. For your

I'm having a hard time conceptualizing c++ sets, actually sets in general. What are they? How are they useful? Don't feel bad if you have trouble understanding sets in general. Most of a degree in mathematics is spent coming to terms with set theory: http://en.wikipedia.org/wiki/Set_theory Think of a set as a collection of unique, unordered objects. In many ways it looks like a list: { 1, 2, 3, 4 } but order is unimportant: { 4, 3, 2, 1} = { 1, 2, 3, 4} and repetitions are ignored: { 1, 1, 2, 3, 4 } = { 1, 2, 3, 4} A C++ set is an implementation of this mathematical object, with the odd

Specifically a Multigraph . Some colleague suggested this and I'm completely baffled. Any insights on this? It's pretty straightforward to store a graph in a database: you have a table for nodes, and a table for edges, which acts as a many-to-many relationship table between the nodes table and itself. Like this: create table node ( id integer primary key ); create table edge ( start_id integer references node, end_id integer references node, primary key (start_id, end_id) ); However, there are a couple of sticky points about storing a graph this way. Firstly, the edges in this scheme are

I have an array of integers (not necessarily sorted), and I want to find a contiguous subarray which sum of its values are minimum, but larger than a specific value K e.g. : input : array : {1,2,4,9,5} , Key value : 10 output : {4,9} I know it's easy to do this in O(n ^ 2) but I want to do this in O(n) My idea : I couldn't find anyway to this in O(n) but all I could think was of O(n^2) time complexity. Let's assume that it can only have positive values. Then it's easy. The solution is one of the minimal (shortest) contiguous subarrays whose sum is > K . Take two indices, one for the start of