There is a site, username and password. Now I do login in a common way - manually, and then check some info in my profile. Is it possible to automatize this process? I mean, to call a function from the server that logins with this information + gets some data from cookies? Can it be done with C# or maybe there are some extentions for this purpose?

I have lines on the image control that are like "walls" and I need to bypass them. Also I have two points, that I need to connect.

Hello, I have a big maze (800x800) and I need to search for a shortest path on it, from one point to another. I tried wave algorithm but it is very-very slow. I have to wait for several minutes. Are there path finding algorithms that can accompish such a task relatively quickly?

Hello, I have an image and I mush find the shortest ways to connects points, and walls must be bypassed. http://imageshack.us/photo/my-images/863/exampley.png Can you recommend algorithm(s), that will help to make this program?

Of course, it won't be free. I just need to know, if it is good as first book on A&DS or not. If not, than... any other recommendations?

I looked at books TOC and reader's reviews -- it is a good book for introduction to DT&A using C++, if the readers don't lie :)

Hi, Has anyone read this book? What can you say about it?

As for me -- even Cormen's book is easier to understand, than Knuth's book.

Hello, What are good books on algorithms and data structures? I know that Cormen's book is very good, but for now it is too hard for me to understand.

It is not free

Yes, of course I made search, but no results :(

Hello, I'm searching for an electronic version of the following book: "ADTs, Data Structures, and Problem Solving with C++", by Larry Nyhoff Where can I download it?

If I do it in this way, the results are:

trunc(7.1) = 7;
trunc(7.6) = 7; // fractional part is just dropped

How can I make a trunc() function in C++, Example:

trunc(7.1) = 7;
trunc(7.6) = 8;

Hello, For example, I have files with sorted numbers. One way to merge them and save a sorted order is to use a merge sort algorithm. Where a C++ realization of the algorithm (for files, not for memory) can be found ?

Hello, I downloaded B+ tree template from ScalingWeb: http://www.scalingweb.com/downloads/B+Tree-1.0.zip but the problem is that I can't make it work, because it uses Qt. I never faced with Qt and don't know what to do. After downloading Qt SDK and reading help, I still don't understand how to make this template work Can someone explain how to use Qt in this situation? I sit on Windows XP.

Hi, does anyone know where sources for B/B+ tree implementation can be found? The main requirements are: - fast access to an element by index - fast writing to a file

I found, that it is possible only to iterate in this way:

multiset s;
multiset::iterator it;

it = s.begin();

for (int i = 0; i < s.size(); ++i)
it++;

I tried to do the following:

it += k;

But that doesn't work. Is there any oppotunity to "jump" to the position?

Is it possible to access element by index (like in array or vector), when using multiset?

Hm... But is it possible to access the element at the specified index in multiset?