Surely the Data Structures & Algorithms course is really helpful?

Question

I remember when I was in DSA, I was like wtf O (n) and wondered where I would use it except at gradient school, or if you are not a candidate such as Bloch. Somehow it uses because it appears in business analysis, so I was wondering when you guys should have called your Big O skills to see how to write an algorithm, what data structure you used to fit or you need was to create a new ds (e.g. your own tree implementation or trie).

Answer 1

Honestly, being able to answer this question is my biggest criterion for serious interviewing interviews. Knowing how basic data structures work, basic O (n) analysis and some light theory are really important for successfully writing large applications.

This is important in the interview, because it is important in the work. I worked with technicians in the past who were self-taught, not taking a course on data structures or not reading a book of data structures, and their code was sometimes bad as it should have appeared.

If you do not know that n2 will run slowly compared to n log n, you need to know more.

As for the later half of data structure courses, it is usually not applicable to most technical tasks, but if you ever want it, you want you to pay more attention.

Answer 2

, , , .

, , , , . "timesaver" " - ".

Answer 3

Big-O , , . , STL, , big-O, , , , , O (1), O (log n) O (n), STL- . MSDN .NET, IIRC Java Java. , , .

Answer 4

( MS EE - PhD, CS, , Joshua Block), , ( , ), "-" ( ). , , - , Python ( ;-), , ( , dict ..); (, gmpy), .

Answer 5

B-Trees , ( 15 , ). e. . ...

Answer 6

: , .. , .

B-Tree , , .

, , , , , , , , O (n), O (nlogn).

... .

, , CRUD- , , ...

Answer 7

, , . biggie, .

Answer 8

... , . , - , . , , (.. ) , .

, , , , , . , , ( ) " " .

Answer 9

, , :

, , , . . , ? .

, , , ( , ) , . : - , nlog (n). , , . , , (, ).

Answer 10

- , : .

Answer 11

, "-" " ", , , , , -. , :

• - - , , .

• . , . , , . - - , . .

• - , , , .

If, for any other reason, I'm glad that I took the time to read information about data structures and algorithms, just to be able to portray new problems in a slightly different way, especially combinatorial problems and graph problems. Graph theory is no longer synonymous with "scary".