how the data in list-array that saved in memory when I use data structure by c++ languege whit not pointer?I n

Answer 1

If you mean STL list, (can you be more specific of what type of list?)

then you can prob. do something like

for(int i = 0; i < mylist.size(); i++)
{
cout< }

Answer 2

Sedgewick (the e book is termed _Algorithms_; Sedgewick, a student of Knuth, BTW, is the author) is between the classic documents structure texts (or a minimum of replaced into in course of the great of my college years). sadly, the unique version used Pascal, and the present version Java, so as that violates one in all of your constraints... and lately, the nearest you'll come to C is weak to be C++. i'd say get the present Sedgewick (to be constructive you receives modern-day documents structures), and pay interest to the algorithms; they are the authentic area. the massive difference is that Java will create issues at will from the heap, the position in C you'll use malloc() (and characteristic to you'd be desiring to apply loose() extremely than depart it to a garbage collector) or, for fairly good applications *if* performance proves major, roll your own allocation in accordance with that different case.