asking anyway (though not a C++ site;)

coder4ever

I need to know how to read in 16 arrays of strings, and then, in alphabetical order, bubblesort them with an early exit... Please! Any help in this matter would be greatly appreciated!!!

gid__

This sounds like you want us to do your homework. 🙂 Never EVER use bubble sort (ok only if it's assigned as homework, but inform you teacher the algorithm sucks 🙂, there's always an easier, faster sort to use, always. I'd suggest buying "Teach yourself c++ in 21 days" ISBN: 067232072X. $24.95 at <A HREF=http://www.amazon.com/exec/obidos/ASIN/067232072X/qid=1001107448/sr=2-1/ref=sr_2_7_1/002-0814189-0292030>http://www.amazon.com/exec/obidos/ASIN/067232072X/qid=1001107448/sr=2-1/ref=sr_2_7_1/002-0814189-0292030</A>

That should have everything you need to know, I'm pretty sure they have a few halfway decent sorting alorithms in there and plenty about string manipulation and arrays. I can't put my hands on the book at the moment, or I'd look up the chapters for you.

gid__

ick, sorry about the link, aparently phpbuilder.com doesn't trust us to do html. 🙂

http://www.amazon.com/exec/obidos/ASIN/067232072X/qid=1001107448/sr=2-1/ref=sr_2_7_1/002-0814189-0292030

Anon

Thanks for your reply, Steve. (you know you were the only one to relpy???) Anyway, it IS an assignment, and though I never wnat anyone to do my work for me, a few tips/good URLS that cover the topic would have helped...
As far as books, I have consulted my textbook for this course, and my text books for my past 2 programming courses, which, although they were slighly better than this course's textbook, still show ifstreams and bubblesort as separate... I can bubblesort, can bubbleosrt strings, and use if- and of- stream objects... However, the reading from a file and then sorting (basically the jist of this assignment) is tripping me up... Well, the professor said that reading in the data woud be the hardest parrt of this assignment, and he's right!!!
Oh, and, yes, in several places, I have read that bubblesorting is a very inefficient algorithm... Our instructor still insists that it is efficient for storage since it only reqiures a new place in memory for the temp variable... (he hasn't gotten into big-O notation and analysis of bubblesort's effieiency except to make us count the # of times the swap and the if are executed, but I have been doing much readig on my own from the aforesaid books😉
Any other suggestions would be greatly appreciated!!!