Search Results

Search found 12 results on 1 pages for 'zebraman'.

Page 1/1 | 1 

• what data structure should I use for hash lookup as well as binary search?

  - by zebraman

  I am working on a school homework. I have a list of names. I want to be able to perform binary search on these names (find all names between a lower and upper bound) for first name as well as last name, and perform keyword searches as well (this will be accomplished using hashing. For example, if I have the names Garfield Cat Snoopy Dog …

  Read the article

• Why might stable_sort be affecting my hashtable values?

  - by zebraman

  I have defined a struct ABC to contain an int ID, string NAME, string LAST_NAME; My procedure is this: Read in a line from an input file. Parse each line into first name and last name and insert into the ABC struct. Also, the struct's ID is given by the number of the input line. Then, push_back the struct into a vector masterlist. I am also…

  Read the article

• How to make an image randomizer from gallery directory?

  - by zebraman

  Hello, I would like to make a image randomizer/slider that randomly displays an image from a designated gallery and has controls to view the next/previous image. I have seen this done where images must be coded into arrays, but I would like to be able to just drop images into a /img/gallery directory and have the randomizer/slider pull random…

  Read the article

• What is the most efficient way to determine if a directed graph is singly connected?

  - by zebraman

  I am working on an assignment where one of the problems asks to derive an algorithm to check if a directed graph G=(V,E) is singly connected (there is at most one simple path from u to v for all distinct vertices u,v of V. Of course you can brute force check it, which is what I'm doing right now, but I want to know if there's a more efficient…

  Read the article

• How can I hash a string to an int using c++?

  - by zebraman

  I have to write my own hash function. If I wanted to just make the simple hash function that maps each letter in the string to a numerical value (i.e. a=1, b=2, c=3, ...), is there a way I can perform this hash on a string without having to first convert it to a c-string to look at each individual char? Is there a more efficient way of hashing…

  Read the article

• Big-O complexity of c^n + n*(logn)^2 + (10*n)^c

  - by zebraman

  I need to derive the Big-O complexity of this expression: c^n + n*(log(n))^2 + (10*n)^c where c is a constant and n is a variable. I'm pretty sure I understand how to derive the Big-O complexity of each term individually, I just don't know how the Big-O complexity changes when the terms are combined like this. Ideas? Any help would be…

  Read the article

• how do copyright permission systems for content hosting sites work?

  - by zebraman

  I am wondering about subscription sites that host content, like recorded performances from concerts. I'm sure there is a tangle of copyright permissions that must be granted for these video/audio files to be hosted. For example, if a band plays a cover of another band's song, permission must be obtained from not only the band that performed,…

  Read the article

• is there a way to use cin.getline() without having to define a char array size before hand?

  - by zebraman

  Basically my task is having to sort a bunch of strings of variable length ignoring case. I understand there is a function strcasecmp() that compares cstrings, but doesn't work on strings. Right now I'm using getline() for strings so I can just read in the strings one line at a time. I add these to a vector of strings, then convert to cstrings…

  Read the article

• what is the underlying data structure of a set c++?

  - by zebraman

  I would like to know how a set is implemented in C++. If I were to implement my own set container without using the STL provided container, what would be the best way to go about this task? I understand STL sets are based on the abstract data structure of a binary search tree. So what is the underlying data structure? An array? Also, how…

  Read the article

• How to compare strings ignoring case (C++)?

  - by zebraman

  I am aware there is a function strcasecmp() that compares cstrings ignoring case, but I was wondering if there is a function that does the same thing except with strings? I am working with a bunch of strings, and feel like it would be terribly inefficient to have to use c_str() each time I want to compare them with strcasecmp(). Should I…

  Read the article

• Is there a way to specify the dimensions of a nested STL vector C++?

  - by zebraman

  I know vectors can be constructed to a predefined size vector<int> foo(4); But is there a way to specify the dimensions of nested vectors? vector< vector<int> > bar(4); Lets say I wanted a vector of size 4 containing vector's of size 4... like a 4x4 multidimensional array of ints?

  Read the article

• is there a way to condense a vector (C++)?

  - by zebraman

  I have a sparsely populated vector that I populated via hashing, so elements are scattered randomly in the vector. Now what I want to do is iterate over every element in that vector. What I had in mind was essentially condensing the vector to fit the number of elements present, removing any empty spaces. Is there a way I can do this?

  Read the article

1