Electronics > Beginners

Data Structure and Algorithms

<< < (3/5) > >>

ankitdixit:
Thanks to all give your suggestions. When I was browsing the web to learn about coding algorithm I found one site and find there is a list of data structure programming tutorials recommended by the programming community. Check this https://hackr.io/tutorials/learn-data-structures-algorithms

westfw:

--- Quote ---I found the Robert Sedgewick books “Algorithms in C” and “Algorithms in C++” to be excellent.
--- End quote ---
I second the recommendation.
The online classes he teaches are also very good...
https://www.coursera.org/learn/algorithms-part1

CLRS is apparently https://en.wikipedia.org/wiki/Introduction_to_Algorithms(in case that's as un-obvious to others as it was to me.)

Mechatrommer:
https://apps2.mdp.ac.id/perpustakaan/ebook/Karya%20Umum/Dsa.pdf
https://people.cs.vt.edu/~shaffer/Book/C++3e20100119.pdf
http://index-of.co.uk/Algorithms/Algorithms%20in%20C.pdf
http://lmgtfy.com/?q=data+structure+and+Algorithm+download (no pun intended, you get the idea)

when i was young, the 1st edition (cant find preview in the net anymore) of this is what i read... nothing beat real book and real paper...
http://iips.icci.edu.iq/images/exam/DataStructuresAndAlgorithmAnalysisInCpp_2014.pdf

coppice:
Algorithm is a pretty broad term. The problem with any book with a title like "Introduction to Algorithms" is it covers algorithms the authors thought relevant, but the majority of people looking for algorithms to deal with their problems won't. You really need to look through the topics list for the book, and see if there is a good selection of material that might have some relevance to you.

westfw:
There are a bunch of "standard DS&A concepts" that "everyone should know", if mostly from the point of view of "when can I just blast out obvious code, and when should I go look for a well-written library that does something more complicated?" (these days, probably no one should write their own quicksort function, for example.  But knowing when you might need one, and when it wouldn't be a good idea, is important.
Other things seem to go in and out of style.  Back when I took a DS class (late 01970s), we spent a lot of time on disk file organization, which I haven't seen mentioned much recently.  IIRC, Volume 2 of Knuth is half random numbers (aimed mostly at simulation, whereas nowadays you'd want a more cryptographically oriented approach) and half numeric algorithms that are generally left to hardware these days.  Volume 1 spends a bunch of pages defining a generic assembly language to use for programming examples.
There is a bunch of numeric stuff (PID, FFT, numeric differentiation, integration, and differential equations, computer graphics, cryptography, and so on) that seem to be considered separate topics (not often taught to CS majors?  No one does MATH with computers any more.)
There are a bunch of published algorithms for any branch of CS or engineering (standardized stuff for figuring out a reasonable retransmission timeout for TCP packets, for example.  Which has undergone fascinating evolution since RFC793...)

So it does depend on what you're after.  If you need an A&DS class on your resume, read one of the books and/or take one of the classes that have been mentioned.  Know your stacks, linked lists, assorted sorts and searches.  if you need something more specialized, you may need to search...

Navigation

[0] Message Index

[#] Next page

[*] Previous page

There was an error while thanking
Thanking...
Go to full version
Powered by SMFPacks Advanced Attachments Uploader Mod