has anyone got or read this book: robert sedgewick "algorithms in c
parts 1-4"?
i'm having an absolute nightmare with the book. amoung other things i'm
trying to construct the necessary support files needed to make use of
the example programmes. (support files as in .h .c files that are
#included and used to compile with).
the programmes are designed to use abstract data types so that you can
drop in different versions of the support files and the main programme
will work happily with the various types (support files that handle
types int, double, variable length strings etc.)
the different implementations and headers of the different support file
types are fragmented throughout the text (sometimes not even code, but
just an english description) and are also incomplete -- some bits that
are required by a program's code don't even have english descriptions
so far as i can tell. so far i've been unable to find a complete set of
any of the support files for any of the types -- some of the parts of
the support files are just assumed and the reader is expected to do
kind of detective work to construct the necessary codewhich is
*completey* crap imo -- it should be on a plate but it's not. i'm
getting severely frustrated because the algorithm side of the book
looks good but i can't get past this basic sort of packaging/logistics
part. (why on earth isn't it made completely obvious? anyway, it
isn't.)
if anyone's followed that book and still have some/any of the code
around, could you post it please? it'd be really appreciated. (a full
set of support files for any one of the types (int, double, variable
length string) would be fantastic. i'm talking about Item.h and ST.h
and also probably Item.c and whatever else if there's more, applicable
in particular to the search section -- chapter 12 onwards).
if not i'm going to post what mess i have so far. now there's threat
you don't want me to follow through on. :)
the book's code on sedgewick's website is of no use (only to save you
typing) -- it's an exact copy of the code in the book, and is in fact
worse, as there are no indications what so ever of names/labels for the
modules of code.
thanks again, ben. 4 3950
ben wrote: has anyone got or read this book: robert sedgewick "algorithms in c parts 1-4"?
i'm having an absolute nightmare with the book. amoung other things i'm trying to construct the necessary support files needed to make use of the example programmes. (support files as in .h .c files that are #included and used to compile with).
the programmes are designed to use abstract data types so that you can drop in different versions of the support files and the main programme will work happily with the various types (support files that handle types int, double, variable length strings etc.)
the different implementations and headers of the different support file types are fragmented throughout the text (sometimes not even code, but just an english description) and are also incomplete -- some bits that are required by a program's code don't even have english descriptions so far as i can tell. so far i've been unable to find a complete set of any of the support files for any of the types -- some of the parts of the support files are just assumed and the reader is expected to do kind of detective work to construct the necessary codewhich is *completey* crap imo -- it should be on a plate but it's not. i'm getting severely frustrated because the algorithm side of the book looks good but i can't get past this basic sort of packaging/logistics part. (why on earth isn't it made completely obvious? anyway, it isn't.)
if anyone's followed that book and still have some/any of the code around, could you post it please? it'd be really appreciated. (a full set of support files for any one of the types (int, double, variable length string) would be fantastic. i'm talking about Item.h and ST.h and also probably Item.c and whatever else if there's more, applicable in particular to the search section -- chapter 12 onwards).
if not i'm going to post what mess i have so far. now there's threat you don't want me to follow through on. :)
the book's code on sedgewick's website is of no use (only to save you typing) -- it's an exact copy of the code in the book, and is in fact worse, as there are no indications what so ever of names/labels for the modules of code.
thanks again, ben.
The code is available online & I used it years ago. Look.
gtoomey
In article <2v************ *@uni-berlin.de>, Gregory Toomey
<no****@bigpond .com> wrote: ben wrote: the book's code on sedgewick's website is of no use (only to save you typing) -- it's an exact copy of the code in the book, and is in fact worse, as there are no indications what so ever of names/labels for the modules of code.
thanks again, ben.
The code is available online & I used it years ago. Look.
gtoomey
i can see code in the book and i can see all of that code repeated on
his website. the problem is that that code (book or website -- they're
both exactly the same) does not allow you to run the programmes as is.
the necessary extra files are incomplete and fragmented throughout the
book, some of which isn't even in code but just english, for example
"...we extend the Item concept ... such that items contain keys of type
Key". nowhere, in code (in book or website), is Key defined or typed or
whatever so that sentance is as far as Key gets -- and there's other
bits that never even get described in english -- they're just missing
(yes they're just defines but all adds to the mess/my confusion -- why
should they be missing?). and it's even more confusing because the
different fragments of the code which need putting together that are to
be included by the programmes are a mixture of the various data types
(as he's using abstract data types, one for double, one for int etc).
there doesn't seem to be a full set of support files for any one of the
abstract data types.
so the organisation/packaging, and some of the gaps in the code, is not
obvious at all to me. it's a shame i'm getting stuck and frustrated on
what shouldn't be an issue -- it should be on a plate but isn't
it's not a question of me not having looked, it's a question of me not
being able to reconstruct and fill in the gaps and know how to organise
it.
:( most frustrating
ben <x@x.com> writes: In article <2v************ *@uni-berlin.de>, Gregory Toomey <no****@bigpond .com> wrote:
ben wrote:
the book's code on sedgewick's website is of no use (only to save you typing) -- it's an exact copy of the code in the book, and is in fact worse, as there are no indications what so ever of names/labels for the modules of code.
thanks again, ben.
The code is available online & I used it years ago. Look.
gtoomey
i can see code in the book and i can see all of that code repeated on his website. the problem is that that code (book or website -- they're both exactly the same) does not allow you to run the programmes as is. the necessary extra files are incomplete and fragmented throughout the book, some of which isn't even in code but just english, for example "...we extend the Item concept ... such that items contain keys of type Key". nowhere, in code (in book or website), is Key defined or typed or whatever so that sentance is as far as Key gets -- and there's other bits that never even get described in english -- they're just missing (yes they're just defines but all adds to the mess/my confusion -- why should they be missing?). and it's even more confusing because the different fragments of the code which need putting together that are to be included by the programmes are a mixture of the various data types (as he's using abstract data types, one for double, one for int etc). there doesn't seem to be a full set of support files for any one of the abstract data types.
so the organisation/packaging, and some of the gaps in the code, is not obvious at all to me. it's a shame i'm getting stuck and frustrated on what shouldn't be an issue -- it should be on a plate but isn't
it's not a question of me not having looked, it's a question of me not being able to reconstruct and fill in the gaps and know how to organise it.
:( most frustrating
I have Part 5 only. I agree, that the algorithms are not complete. I
had to fill the missing parts myself. This forces to actually
understand the book, istead of just coping the code.
In article <1100564873.wBA smficAl63DG5bpq +hkw@teranews>, bazad
<no****@noreply .not> wrote: ben <x@x.com> writes:
.... it's not a question of me not having looked, it's a question of me not being able to reconstruct and fill in the gaps and know how to organise it.
:( most frustrating
I have Part 5 only. I agree, that the algorithms are not complete. I had to fill the missing parts myself. This forces to actually understand the book, istead of just coping the code.
but the type of code that's missing is packaging / setup code,
essential but periferal to the workings of the algorithm. even if
missing lines of code and the act of filling in the gaps, second
guessing, is a good way to teach/learn (which i'm not sure about), the
area that the missing parts cover are in an unsuiteable book. they
would be more appropriate in a 'how to programme in c' book than an
algorithm book.
the hand waved / missing parts of code has forced me to get bogged down
with and concentrate on stuff other than algorithms.
i personally don't think the author left out these pieces of code for
tutoring purposes -- i think lazyness/lack of thoroughness was the
reason. if you found it a help in learning about algorithms that's
great, but i'm finding it quite unhelpful and frustrating.
(btw, a positive thing to say about the book: the diagrams: top quality)
anyway, i still would really appreciate it if anyone could post a full
working set/collection of the necessary code modules for any one of the
programmes (preferably from the 'searching' section (ch12 onwards)
involving Item.h and ST.h etc for any one of the data types) in
'algorithms in c parts 1-4' by sedgewick. (i'm not talking about the
exercises, but the example programmes)
thanks, ben. This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics |
by: HERC777 |
last post by:
just paste the below into notepad, call it iqsort.html double click it
and your IE browser will run it. (neat! a universal programming
language we can all run!)
it falls out from the sort procedure. I got javascript quicksort
running, it's quick but it gets stack overflow after about 5000
elements.
Am I passing the array as a parameter alright? I think javascript
default is to pass pointers, that can be global.
|
by: John McCabe |
last post by:
Hi
I'm looking for something equivalent to the Data Structures and
Algorithms in Ada 95 books by Biedler and Feldman etc, but based
towards efficient C++ implementations.
Does anyone know of such a thing and could recommend one?
I'm particularly interested in coverage of binary search trees,
especially Red-Black, Splay and AVL, as well as hashing tables and
|
by: ben |
last post by:
(this isn't going to make any sense unless you have sedgewick's
"algorithms in c parts 1-4" (but the 2nd question might make sense))
page 484, program 12.2 -- exactly what code/files should be used with
it in order to compile program 12.2?
there's two lines:
#include "Item.h"
#include "ST.h"
but it is not clear at all which files or code they are. i've had a
|
by: Anders Borum |
last post by:
Hello!
I'm starting to dive into algorithms in general (sorting, trees etc.) and am
currently reading a book from Robert Sedgewick called "Algorithms in C++,
3rd. Edition" and would like other book recommendations on algorithms,
perhaps less hardcore than this one.
Although very interesting, I realize I need to get a solid foundation before
fully understanding the advanced topic covered in that book and would ask
for recommendations...
|
by: johnny |
last post by:
I am looking onto some C examples about graphs: implementation with
adjacent matriz or with linked list, and how can I visit the vertex.
Any sample code ???
Tna
Johnny
| |
by: qassim313 |
last post by:
Hi,
does anyone has the answer for these Q:-
1.Differentiate Fixed list From Dynamec list?
2. Explane linked list with example?
3. What do you understand by node?
4.write algorithms to add an element/node in to link list
|
by: vlsidesign |
last post by:
I am a newbie and going through "The C programming language" by
Kernighan & Richie on my own time (I'm not a programmer but I want to
learn because it can save me time in my normal job, and it is kind of
fun). As I go through the book, I seek to do all the exercises because
they are very useful, and good, but it seems like I am just stumbling
through somewhat. In particular, I don't really know how to think about
"catching errors", or how...
|
by: arnuld |
last post by:
i am looking for "algorithms in C++" book. Knuth is FULL of
Mathematics, not my kind of author. i checked ACCU and got these
(listing only those that are available in my country:
1. Algorithms in C++ -- Robert Sedgewick (3e)
2. Data Structures and Algorithms Analysis - Mark Allen Weiss (2e)
3. Introduction to Computing and Algorithms - Russell Shackelford
(1e)
4. Introduction to Algorithms - Cormen et al.(2e)
|
by: CellDivider |
last post by:
Hello folks,
currently I'm looking for a good books that gives an overview of
useful c/c++ algorithms and design patterns, in the manner of "what's
the most efficient way to implement <often used function", singleton
pattern etc. pp. . It should cover as much as possible.
How good is this one?
|
by: bill |
last post by:
Turning on error_reporting(E_ALL); was quite an eye opener as to
how much "fixing" PHP will do for the sloppy coder.
I fixed all of the errors except:
Notice: Undefined property: parts in
/ContactManagement/contact_mainpage.php on line 120
where the line in question is:
$parts = $struct->parts;
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However, people are often confused as to whether an ONU can Work As a Router. In this blog post, we’ll explore What is ONU, What Is Router, ONU & Router’s main usage, and What is the difference between ONU and Router. Let’s take a closer look !
Part I. Meaning of...
| |
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it.
First, let's disable language synchronization. With a Microsoft account, language settings sync across devices. To prevent any complications,...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed.
This is as boiled down as I can make it.
Here is my compilation command:
g++-12 -std=c++20 -Wnarrowing bit_field.cpp
Here is the code in...
|
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven tapestry of website design and digital marketing. It's not merely about having a website; it's about crafting an immersive digital experience that captivates audiences and drives business growth.
The Art of Business Website Design
Your website is...
|
by: agi2029 |
last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing, and deployment—without human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then launch it, all on its own....
Now, this would greatly impact the work of software developers. The idea...
|
by: adsilva |
last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?
|
by: 6302768590 |
last post by:
Hai team
i want code for transfer the data from one system to another through IP address by using C# our system has to for every 5mins then we have to update the data what the data is updated we have to send another system
| |
by: muto222 |
last post by:
How can i add a mobile payment intergratation into php mysql website.
|
by: bsmnconsultancy |
last post by:
In today's digital era, a well-designed website is crucial for businesses looking to succeed. Whether you're a small business owner or a large corporation in Toronto, having a strong online presence can significantly impact your brand's success. BSMN Consultancy, a leader in Website Development in Toronto offers valuable insights into creating effective websites that not only look great but also perform exceptionally well. In this comprehensive...
| |