Mastering competitive programming
Material type: TextPublication details: New Delhi : Coding Blocks, ©2018Description: 340 p. ; 28 cmISBN:- 9788193754306
- 005.1 NAR-M
Contents:
1 Generic Programming & STL
2 Mathematics
3 Number Theory
4 Binary Search (Divide & Conquer)
5 Greedy Algorithms
6 Recursion & Backtracking Segment Tree (Divide & Conquer)
7 Binary Indexed Tree/Fenwick Tree
8 Binary Indexed Tree/Fenwick Tree
9 Dynamic Programming
10 MO's Algorithm
11 Graph Algorithms
12 Game Theory
13 Geometric Algorithms
14 Fast Fourier Transform
15 Heavy Light Decomposition (HLD)
Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
Books | IIITD General Stacks | Computer Science and Engineering | REF 005.1 NAR-M (Browse shelf(Opens below)) | Not for loan | Gifted by Dr. Rahul Gupta | G02443 |
Total holds: 0
Browsing IIITD shelves, Shelving location: General Stacks, Collection: Computer Science and Engineering Close shelf browser (Hides shelf browser)
No cover image available | ||||||||
REF 004.62 LOS-I IPv6 : | REF 005.1 LOP-G Getting started with LLVM core libraries: | REF 005.1 MAS-P Pragmatic version control : | REF 005.1 NAR-M Mastering competitive programming | REF 005.117 BLA-O Object-oriented modeling and design with UML | REF 005.133 ALB-M Machine learning with Python cookbook : practical solutions from preprocessing to deep learning | REF 005.133 HOR-C Core Java for the impatient |
1 Generic Programming & STL
2 Mathematics
3 Number Theory
4 Binary Search (Divide & Conquer)
5 Greedy Algorithms
6 Recursion & Backtracking Segment Tree (Divide & Conquer)
7 Binary Indexed Tree/Fenwick Tree
8 Binary Indexed Tree/Fenwick Tree
9 Dynamic Programming
10 MO's Algorithm
11 Graph Algorithms
12 Game Theory
13 Geometric Algorithms
14 Fast Fourier Transform
15 Heavy Light Decomposition (HLD)
There are no comments on this title.