RE: [Dev-C++] dynamic allocation and structs

[Ioannis V. <no...@ho...>]

> -----Original Message-----
> From: dev...@li... 
> [mailto:dev...@li...] On Behalf 
> Of Per Westermark
> Sent: Friday, October 25, 2002 1:54 PM
> To: Ioannis Vranos
> Cc: Dev-C++ Mailing List
> Subject: RE: [Dev-C++] dynamic allocation and structs
> 
> 
> Exactly why my previous mail specified use-cases.
> 
> - Sparse matrix, where a lot of entries are NULL.
> - Quick sort, since it's enough to move the pointers.


As far as i can think of it, you can't use qsort() though. qsort()
copies the elements and in addition, you can't compare pointers not
pointing inside the same array. So you have to define your own
facilities.


Ioannis

* Ioannis Vranos
* Programming pages: http://www.noicys.freeurl.com
* Alternative URL: http://run.to/noicys