Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you may not be able to execute some actions.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

Books on algorithms

E
elysha last edited by

I'm looking for a book on basic algorithmization. The basic requirement is a simple and accessible version of the material in the book and was intended for newcomers in the case. Algorithms are my weakest part in programming, so I want to work on it. So please advise the book. More grateful for your help.
Reply Quote 0
1 Reply Last reply
Bogopo last edited by

http://www.ozon.ru/context/detail/id/2429691/ Read, basic knowledge (if read from the beginning) No, no, no, no, no, no, no, no, no, no.
In fact, serious knowledge baggage is necessary. only for strict mathematical justification of the correctness of algorithms and complexity assessments, And to understand most of the evidence, I think your knowledge will be sufficient. (because things are like группового and амортизационного analysis in the book is gradually introduced.
Reply Quote 0
1 Reply Last reply

2
Posts

0
Views

Suggested Topics

D

How to handle bookmarks in Reflowable books
Usability Testing • books dynamic ui • • derk

2

0
Votes

2
Posts

1
Views

Rob E's excellent answer covers the case where the application can (and the user wants to) mark specific passages of text. If you also have (or want to offer) a simple "bookmark this page" option, without the user needing to mark a specific passage, then I think you should store the "location" of the paragraph at the top of the current page. When returning to the bookmark, display the stored location at the top of the new page. My first instinct was to suggest storing the location that's closest to the middle of the current page (with the reasoning that if you put that bit of text in the middle of the page when you return to a bookmark you would be "reasonably close" to where the reader wanted to be, most of the time, for most zoom levels). However, as an avid Kindle user, I thought about when I use the bookmark function as opposed to highlighting a passage of text: If a work of fiction has a map of the area where the action takes place, I'll often bookmark that page so I can return to it easily if I need to check the geography. If there is some kind of glossary, list of characters, ... list of almost anything, I again might bookmark the first page of such a list so I can return to it easily. The common thing is that the thing I'm marking is usually either the only thing on the page (very often the case with maps) and/or forcibly starts a new page (usually the case with glossary or similar). In both cases, going back to the beginning of the page originally marked seems to be the correct thing to do. Also, as Monty Harder pointed out in a comment, when using a bookmark for its "traditional" purpose – going back to where you left off reading – then bringing the text that used to be at the top of the page back to the top of the page (even if the zoom-level is different) is the safest option: at worst, you might have to skim over some parts you've already read. However, if you brought what was in the middle of the page back to the middle, there is a chance (if the zoom-level has increased) that unread portions of the text have been pushed back on to the preceding page.
R

Algorithm problem
Software Programming • algorithm c+++ • • Rossere

2

0
Votes

2
Posts

0
Views

Try this algorithm.int check_tree(int a[], int i, int count_a, int sum, int m) { if (i >= count_a) { return 0; } int new_sum = a[i] + sum; if (new_sum == m) { return 1; } if (check_tree(a, i + 1, count_a, sum, m)) { return 1; } return check_tree(a, i + 1, count_a, new_sum, m); } int main() { int m; int a[] = { 16, 20, 77, 40, 55, 30, 70, 80, 120, 150 }; int count_a = 10; printf("type m: "); scanf("%d", &m); if (check_tree(a, 0, count_a, 0, m)) { printf("\nSuccess!"); } else { printf("\nFail!"); } _getch(); return 0; } I didn't start a force set from the keyboard.
N

Euler's project. Target 106. Special subsamples: Meta-verification
Software Programming • python algorithm • • Nykeriab

2

0
Votes

2
Posts

0
Views

LetA = {a, b, c, d} It is known that the sequence is stricter:a < b < c < d Also on the basis of compliance with the second rule, it is known that the sum of any greater sub-number is greater than any less:a + b > c a + b > d ... b + c + d > a The first rule remains to be proved, i.e. the inequality of subsamples of the same size:a + b != c + d a + c != b + d a + d != b + c The first case is automatically correct, because each right-handed portion is bigger than each left, so the amount is bigger.a + b < c + d So second, because b > a and d > cSo...a + c < b + d And the third case needs to be checked, because at least b > abut c > d
A

How do you make the application logical?
Software Programming • c sharp algorithm • • Avante

2

0
Votes

2
Posts

0
Views

E

On a general point. Log4Net - almost standard (no bicycle invention) Maybe help AOP.I don't know how to write in the log without endangering the useful code of the program and not complicating its reading.Write in a separate log file or other storage facility, obviously. Either the same log4Net uses different levels of recording.How to record the most detailed log, even if the program falls,The most detailed log is, strangely, when the exception is logiced. First of all, if there is an up-to-date glass, a mistake should not hide in the "internal details of implementation" and reach a global processor of errors in its original form or with its additions. Second, it should be processed either with a record in a storage facility or mailed to developers and others.
What is this algorithm written on scala?
Software Programming • scala • • Demir

2

0
Votes

2
Posts

0
Views

Well, it's not unique, you know, it's a sorting thing like that. https://neerc.ifmo.ru/wiki/index.php?title=%D0%91%D1%8B%D1%81%D1%82%D1%80%D0%B0%D1%8F_%D1%81%D0%BE%D1%80%D1%82%D0%B8%D1%80%D0%BE%D0%B2%D0%BA%D0%B0 ♪The code shows that the list is first broken into two parts and then it is recurringly sorted.If this is not a quick sort, it is possible to search for algorithms, which, when sorted, divide the reference mass into two parts.
M

Overfishing algorithm
Software Programming • c++ algorithm • • magpie

2

0
Votes

2
Posts

0
Views

My decision has the idea of overthrowing, let's imagine that each item we can compare the number. 1 If we take him to the left weights. 0 if they are not used and -1 If they're against a sportsman. Then we'll be able to take all the weight for it. 3^(k) where k is the number of objects for the task 531441 I don't know what we're doing. The target code is listed below. https://www.e-olymp.com/uk/submissions/3906267 #include <iostream> using namespace std; int x , p = 8; int arr[12] = {0 , 1 , 2 , 4 , 8 , 16 , 32 , 64 , 128 , 256 , 512 , 1024} , k = 0;//индексация массива с елиницы void du(int c , int r[12]) { if(c == 11)//когда мы набрали нужное количество гирь { k++; int sum = 0 , l = 0; for(int i = 1;i < 12;i++)//проходим по предметам { sum += arr[i] * r[i];//в зависимости от места прибавляем , отнимаем или ничего не делаем if(r[i]) l++; } if(sum == x) { p = min(l , p);//нам нужно минимальное количество } return ; } //вызов всех возможных вариантов r[c+1] = 0; du(c+1 , r); r[c+1] = 1; du(c+1 , r); r[c+1] = -1; du(c+1 , r); } int main() { cin >> x; int arr[12] = {0};//текущий набор(0 , 1 ,-1)согласно описанию више du(0 , arr); cout << p;//вывод ответа }
P

About the process of mathema deformation
Software Programming • algorithm mathematic languages • • Pearlaqua

2

0
Votes

2
Posts

0
Views

A

I explained that I can understand what I learned at high school. If you have any questions, please contact us.【3/18 19:25 Update】The first of the third line in the description imageΣHome1Homen-1 0Homen-1Comment Sorry.【UP】D 3/20】40】I imagined that there is no question about this.If you have any questions, please contact us.
J

Help me finish the algorithm.
Software Programming • c sharp algorithm olimpiad • • jules

2

0
Votes

2
Posts

0
Views

B

(l / "Сторона крупнейшего квадрату") * (h / "Сторона крупнейшего квадрату")
Justification of NCA algorithm
Software Programming • algorithm • • Mystic

2

0
Votes

2
Posts

0
Views

F

The cycle consists of NCDs and through it and the NDC (in the last formula). The NCD is on Euclid algorithm. If both (a) and (b) are divided into (d), the difference is (a) (b) divided into (d). For a tie b number a - b less a. If this is not the case, a. So, for each couple (a, b) at a constant b, we can find a few smaller numbers that have the same largest common divider. Discontinuation when a = b. That's the NCD.
T

What defines a "good" cryptographic algorithm?
Security, Penetration Testing • algorithm cryptography • • tahishae

2

0
Votes

2
Posts

0
Views

A good algorithm satisfies security requirements (e.g. a hash function needs to be collision resistant, preimage-resistant or a cipher needs to satisfy ciphertext indistinguishability) the tricky part here is how to justify that it satisfies the security requirements. We rely on security reductions (''proofs''), extent of external analysis (e.g. algorithm published in a respected journal and analyzed for a couple of years could be expected ''better''' than something kept secret) and experience of the designers (e.g. I would trust the designers of AES more than some random person posting to a newsgroup) satisfies performance requirements for the given application and range of target platforms is easy to implement in a secure way (e.g. some algorithms are easier to protect against side-channels than others, simpler algorithms are easier to implement correctly) an extra feature is that it ''fails gracefully'' e.g. if some of the assumptions required for correct operation are not satisfied it doesn't lead to catastrophic insecurity but only degradation of the security level. A good example would be nonce reuse in authenticated encryption schemes. Some of the designs fail dramatically while others can maintain some level of security.
F

Best decision to read A and B from the file and to withdraw their amounts to the file
Software Programming • java algorithm java output stream • • fbio

2

0
Votes

2
Posts

0
Views

S

I've got this code. import java.io.File; import java.io.FileNotFoundException; import java.io.PrintWriter; import java.util.Scanner; public class calc { public static void main(String[] args) { long result = 0; try (Scanner scanner = new Scanner(new File("input.txt"))) { result = scanner.nextInt() + scanner.nextInt(); //System.out.println(result); } catch (FileNotFoundException e) { e.printStackTrace(); } try{ PrintWriter pw = new PrintWriter(new File("output.txt")); pw.println(result); pw.close();}catch(Exception e){e.printStackTrace();} } ♪
B

Module degrees do not pass all tests
Software Programming • c++ c language algorithm • • baileigh

2

0
Votes

2
Posts

0
Views

Binary degree and " very long arithmetic " : " Taking a mod from a long number.#include <iostream> #include <string> using namespace std; const long long mod = 1000000007; long long int powLL(long long int x, long long int n) { long long int result = 1; x %= mod; if(x == 0) return 0; while (n) { if (n & 1) result = (result * x) % mod; n /= 2; x = (x * x) % mod; } return result; } long long int powStrings(string sa, string sb) { long long int a = 0, b = 0; for (int i = 0; i < sa.size(); i++) a = (a * 10 + (sa[i] - 0x30)) % mod; for (int i = 0; i < sb.size(); i++) b = (b * 10 + (sb[i] - 0x30)) % mod; return powLL(a, b); } int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); string sa, sb; cin >> sa >> sb; cout << powStrings(sa, sb) << endl; return EXIT_SUCCESS; }
Copy origin book data after the last empty row of the target book
Software Programming • excel vba • • carriann

2

0
Votes

2
Posts

0
Views

How about, I did it with these two lines, they can adjust it to your needs.wsCopyFrom.Range("A1:M" & wsCopyFrom.Range("A" & Rows.Count).End(xlUp).row).Copy wsCopyTo.Range("A" & wsCopyTo.Range("A" & Rows.Count).End(xlUp).row + 1).PasteSpecial xlPasteFormats The second line hits you in the last available row of your book.
PHP. Assistance with algorithm
Software Programming • php database algorithm • • Mystic

2

0
Votes

2
Posts

0
Views

A

In addition to the list of cities and their ips (for the definition of the city - what I understand you already have) you need to add the tree of the towns/areas/areas to understand what kind of city the bigger "glass" is.Then you won't have duplicates and you can place a banner both for a particular city and for a whole area if you don't want to list all the towns of the area or area.Read the trees in the graph theory. https://ru.wikipedia.org/wiki/%D0%94%D0%B5%D1%80%D0%B5%D0%B2%D0%BE_(%D1%82%D0%B5%D0%BE%D1%80%D0%B8%D1%8F_%D0%B3%D1%80%D0%B0%D1%84%D0%BE%D0%B2) This is being implemented in different ways. The most banal is to start another field in the city table - "extreme object" and through this field, to celebrate what city is in which larger facility.Россия Тверская область Тверь Кашинский район город Кашин Башкортостан Уфа Куюргазинский район город Кумертау etc.Determining a specific city by ip, just check that there's a banner for him. If it's empty, check for the city that's above (more common case) even higher and higher. Until you get to the top node. When I found something to show you, you show me.
J

Lexer: algorithm
Software Programming • c language compiler lecturer • • jonetta

2

0
Votes

2
Posts

0
Views

N

Look. First, you can't figure out if the key word has been found until you've seen the text before the end of the key word. There's a simple algorithm out of here: read the symbols before the end of the word, and look for that word in the table of keywords.A simple bulkhead may be used to search the table, and this is usually sufficient if key words are reasonable.But you can and can make it more difficult/effective: use algorithm like this. https://ru.wikipedia.org/wiki/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC_%D0%90%D1%85%D0%BE_%E2%80%94_%D0%9A%D0%BE%D1%80%D0%B0%D1%81%D0%B8%D0%BA who can effectively find a set of lines in the text. (To be built inside) triethe prefixed tree that followed https://ru.stackoverflow.com/a/417593/10105 recently.)Note that there is a popular utilisation. lex (and her open source-analogue) flexwhich does what it is: a set of key words (as well as regular expressions, so that lex A more advanced thing) builds the right search tree, and gives you a C reference code that just needs to be connected to the project.

Books on algorithms

Suggested Topics

How to handle bookmarks in Reflowable books Usability Testing • books dynamic ui • • derk

Algorithm problem Software Programming • algorithm c+++ • • Rossere

Euler's project. Target 106. Special subsamples: Meta-verification Software Programming • python algorithm • • Nykeriab

How do you make the application logical? Software Programming • c sharp algorithm • • Avante

What is this algorithm written on scala? Software Programming • scala • • Demir

Overfishing algorithm Software Programming • c++ algorithm • • magpie

About the process of mathema deformation Software Programming • algorithm mathematic languages • • Pearlaqua

Help me finish the algorithm. Software Programming • c sharp algorithm olimpiad • • jules

Justification of NCA algorithm Software Programming • algorithm • • Mystic

What defines a "good" cryptographic algorithm? Security, Penetration Testing • algorithm cryptography • • tahishae

Best decision to read A and B from the file and to withdraw their amounts to the file Software Programming • java algorithm java output stream • • fbio

Module degrees do not pass all tests Software Programming • c++ c language algorithm • • baileigh

Copy origin book data after the last empty row of the target book Software Programming • excel vba • • carriann

PHP. Assistance with algorithm Software Programming • php database algorithm • • Mystic

Lexer: algorithm Software Programming • c language compiler lecturer • • jonetta

How to handle bookmarks in Reflowable books
Usability Testing • books dynamic ui • • derk

Algorithm problem
Software Programming • algorithm c+++ • • Rossere

Euler's project. Target 106. Special subsamples: Meta-verification
Software Programming • python algorithm • • Nykeriab

How do you make the application logical?
Software Programming • c sharp algorithm • • Avante

What is this algorithm written on scala?
Software Programming • scala • • Demir

Overfishing algorithm
Software Programming • c++ algorithm • • magpie

About the process of mathema deformation
Software Programming • algorithm mathematic languages • • Pearlaqua

Help me finish the algorithm.
Software Programming • c sharp algorithm olimpiad • • jules

Justification of NCA algorithm
Software Programming • algorithm • • Mystic

What defines a "good" cryptographic algorithm?
Security, Penetration Testing • algorithm cryptography • • tahishae

Best decision to read A and B from the file and to withdraw their amounts to the file
Software Programming • java algorithm java output stream • • fbio

Module degrees do not pass all tests
Software Programming • c++ c language algorithm • • baileigh

Copy origin book data after the last empty row of the target book
Software Programming • excel vba • • carriann

PHP. Assistance with algorithm
Software Programming • php database algorithm • • Mystic

Lexer: algorithm
Software Programming • c language compiler lecturer • • jonetta