### Algorithms and data structures 2

Lectures:

1. Intro: about methods of algorithm design, analysis of algorithms, and  computational complexity of algorithms and problems
2. Divide-and-Conquer: description of  the method, examples of problems and algorithms (see examples 12 below)
3. Greedy  method: description, examples
4. Iterative improvement: descr., examples
5. Dynamic programming: descr., examples
6. Backtracking: description, examples
7. Branch&Bound: description, examples
8. Linear programming: descr., Simplex algorithm, examples
{"ft_lang_label":"__label__en","ft_lang_prob":0.780517,"math_prob":0.96209204,"size":1597,"snap":"2022-27-2022-33","text_gpt3_token_len":319,"char_repetition_ratio":0.18644068,"word_repetition_ratio":0.0,"special_character_ratio":0.18973075,"punctuation_ratio":0.20634921,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9631986,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-06-26T01:45:17Z\",\"WARC-Record-ID\":\"<urn:uuid:9cad14a9-6655-4f0f-99c1-87ca8a7f0a9a>\",\"Content-Length\":\"58360\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:511a3639-21ee-471f-9c65-b78deb9c6c95>\",\"WARC-Concurrent-To\":\"<urn:uuid:5622c068-4f42-4f2a-b760-71cbf723ec34>\",\"WARC-IP-Address\":\"212.235.188.23\",\"WARC-Target-URI\":\"https://ucilnica.fri.uni-lj.si/course/info.php?id=73\",\"WARC-Payload-Digest\":\"sha1:C64SRZF2XFKXUGIYF33JN6WHIP5JZIIW\",\"WARC-Block-Digest\":\"sha1:WLI2W7KVHJ5PISOMZNDYL43OR4KR3TY2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656103036363.5_warc_CC-MAIN-20220626010644-20220626040644-00512.warc.gz\"}"}