[{"_1":2,"_310":-5,"_58":-5},"loaderData",{"_3":4,"_13":14},"root",{"_5":6,"_7":8,"_9":-5,"_10":8,"_11":-5,"_12":-5},"isLoggedIn",false,"url","https://www.curios.com/projects/0x0a4bd717f4b13da3ea50d1cae7af13e4a8e643cf","cartData","canonicalUrl","loginIntent","migratedGuestEmail","routes/projects.$projectId",{"_15":16,"_64":65,"_244":245},"project",{"_17":18,"_56":57,"_58":59,"_60":61,"_63":37},"RESULTS",{"_19":20,"_21":22,"_23":24,"_25":26,"_27":24,"_28":29,"_30":31,"_32":33,"_34":35,"_36":37,"_38":39,"_40":24,"_41":42,"_43":37,"_44":37,"_45":46,"_47":48,"_49":37,"_50":51,"_52":53,"_54":55},"CREATOR_USER_NAME","slimanesaze","CREATOR_AVATAR","https://cdn.curios.com/8989/3A9B89D4-9B44-9698-CA5F9B0C7A508D6F.jpg","BLOCKCHAIN_ADDRESS","","CONTRACT_FORMAT","ERC721","DTS_PUBLISHED","CREATOR_ID","14JNKL","STATUS","Finalizing...","SYMBOL","CUR071380","DESCRIPTION"," \n

The \"Algorithms Notes for Professionals\" book is a free and detailed guide to essential algorithms in computer science. It offers practical examples and clear explanations of key topics, including:

Sorting and Searching: Techniques like quick sort, merge sort, and binary search.

Graph Algorithms: Concepts like BFS, DFS, Dijkstra's, and minimum spanning trees.

Dynamic Programming: Breaking problems into smaller, manageable subproblems.

Data Structures: Covers linked lists, trees, heaps, and more.

Optimization: Focus on improving algorithm efficiency and performance.

Ideal for students and professionals, this book enhances problem-solving and coding skills for real-world applications.

\n ","CREATOR_IS_FOLLOWED",0,"IMAGE_PREVIEW","https://cdn2.curios.com/75c15510-8fca-4d18-8477-46745556f075","EXTERNAL_ID","TITLE","Algorithms Notes for Professionals book","SUPPLY","CONTRACT_SUPPLY_REMAINING","ID","0x0a4bd717f4b13da3ea50d1cae7af13e4a8e643cf","TYPE","BOOK","ROYALTIES","BLOCKCHAIN","Polygon","CREATOR_DISPLAY_NAME","Silmane","COLLABORATORS",[],"success",true,"errors",[],"data",{"_19":20,"_21":22,"_23":24,"_25":26,"_27":24,"_28":29,"_30":31,"_32":33,"_34":35,"_36":37,"_38":39,"_40":24,"_41":42,"_43":37,"_44":37,"_45":46,"_47":48,"_49":37,"_50":51,"_52":53,"_54":62},[],"EXECUTION_TIME","collections",[66],{"_67":68,"_69":70,"_71":37,"_19":20,"_72":39,"_73":74,"_75":76,"_94":24,"_95":24,"_96":42,"_97":37,"_98":24,"_36":37,"_34":99,"_100":101,"_108":109,"_110":37,"_44":37,"_45":109,"_111":74,"_47":48,"_52":53,"_112":24,"_21":22,"_113":46,"_114":115,"_116":24,"_117":74,"_118":24,"_119":37,"_120":121,"_122":109,"_123":24,"_124":125,"_147":148,"_41":42,"_162":106,"_163":164,"_165":166,"_167":168,"_169":37,"_54":170,"_171":172,"_173":37,"_174":37,"_175":176,"_177":178,"_206":37,"_207":37,"_28":70,"_208":37,"_209":210,"_233":234,"_235":236,"_237":106,"_238":239,"_187":37,"_240":241,"_242":243},"ATTRIBUTES",[],"CREATOR_ID_INT",403653,"NUM_TOKENS","PREVIEW_IMAGE","DEBUGLISTINGS",1,"LISTINGS",[77],{"_78":74,"_79":80,"_81":24,"_82":83,"_84":37,"_85":37,"_86":87,"_88":37,"_89":90,"_91":37,"_92":93},"is_buy_now","buy_now_url","https://checkout.curios.com/order/commit/?test=1&listing=984551&session=","dts_end","price_buy_now",2.99,"is_bid","price_min_bid","id",984551,"price_buy_now_retail","dts_start","2025-01-21 17:49:06","is_featured","currency_code","USD","SUBTITLE","PREVIEW_IMAGE_BLURHASH","PROJECT_NAME","CONTRACT_SUPPLY","PREVIEW_VIDEO","

Sorting and Searching: Techniques like quick sort, merge sort, and binary search.

Graph Algorithms: Concepts like BFS, DFS, Dijkstra's, and minimum spanning trees.

Dynamic Programming: Breaking problems into smaller, manageable subproblems.

Data Structures: Covers linked lists, trees, heaps, and more.

Optimization: Focus on improving algorithm efficiency and performance.

Ideal for students and professionals, this book enhances problem-solving and coding skills for real-world applications.

","CREATOR",{"_45":29,"_102":20,"_103":37,"_104":22,"_105":106,"_107":53},"USER_NAME","IS_FOLLOWED","AVATAR","NUM_FOLLOWERS",8,"DISPLAY_NAME","COLLECTION_ID","0x8a736555ec55ef6a623b66bbb88f983773218846","MINTAGE_QTY","A_TEST","CONTRACT_DTS_DEPLOYED","CONTRACT_ID","COLLECTION_TYPE","Other","CONTRACT_ADDRESS","CONTRACT_IS_DEPLOYED","PREVIEW_AUDIO","COLLECTION_SUPPLY","GATES",[],"HASH","IS_LIKED","COLLECTION_CATEGORIES",[126,143],{"_127":128,"_130":141,"_132":-5,"_133":136,"_135":37,"_137":142,"_139":140},"cat_subs",[129],{"_130":131,"_132":-5,"_133":134,"_135":136,"_137":138,"_139":140},"cat_label","Ebook","cat_description","cat_id",12,"cat_parent_id",11,"cat_slug","ebook","cat_type","content_types","Book","book",{"_127":-5,"_130":144,"_132":-5,"_133":145,"_135":37,"_137":146,"_139":142},"Science & Engineering",43,"science-engineering","META_DATA",{"_149":74,"_150":151,"_152":151,"_153":154,"_155":37,"_156":74,"_157":158,"_159":37,"_160":161},"content_quality","num_reviews",4,"rating","goodreads_data","{}","spiciness","is_reviewed","spiciness_explanation","The book is a technical guide on algorithms and does not contain any explicit or risque content.","is_explicit","num_ratings",27,"COLLECTION_TYPE_ID","DTS_CREATED","January, 21 2025 18:08:00","MINTAGE","limited","ID_HASH","VA4QL1","IS_EXPLICIT",[],"VARIATIONS",[],"CONTRACT_NUM_TOKEN_SALES","CONTRACT_AMOUNT_SALES_SECONDARY","PREVIEW_FILES_EPUB",[],"PREVIEW_FILES_IMAGE",[179,194,200],{"_180":24,"_181":74,"_182":183,"_34":24,"_40":184,"_185":186,"_187":74,"_188":189,"_190":24,"_191":39,"_47":192,"_163":193},"CREDITS","IS_PRIMARY","FILE_EXTENSION","com/75c15510-8fca-4d18-8477-46745556f075","75c15510-8fca-4d18-8477-46745556f075","BUCKET","IMAGE","SORT_ORDER","LABEL","AlgorithmsGrow.png","THUMBNAIL","FILE","external_image","January, 21 2025 18:08:05",{"_180":24,"_181":37,"_182":195,"_34":24,"_40":196,"_185":186,"_187":74,"_188":197,"_190":24,"_191":198,"_47":192,"_163":199},"com/603ee9d1-e4b9-4b3c-80d0-ffd9e789aafb","603ee9d1-e4b9-4b3c-80d0-ffd9e789aafb","AlgorithmsExamplePage3.png","https://cdn2.curios.com/603ee9d1-e4b9-4b3c-80d0-ffd9e789aafb","January, 21 2025 18:08:13",{"_180":24,"_181":37,"_182":201,"_34":24,"_40":202,"_185":186,"_187":203,"_188":204,"_190":24,"_191":205,"_47":192,"_163":199},"com/8d1e08ac-1c67-4f10-a5ea-dcd86b4cb72c","8d1e08ac-1c67-4f10-a5ea-dcd86b4cb72c",2,"AlgorithmsExamplePage1.png","https://cdn2.curios.com/8d1e08ac-1c67-4f10-a5ea-dcd86b4cb72c","CONTRACT_AMOUNT_SALES_PRIMARY","CONTRACT_NUM_TOKENS_MINTED","REQUIRES_SHIPPING","PRIVATE_FILES",[211,225],{"_180":24,"_212":37,"_213":37,"_182":214,"_190":24,"_215":24,"_216":24,"_34":24,"_40":217,"_218":219,"_187":74,"_188":189,"_41":189,"_45":220,"_221":222,"_191":24,"_47":192,"_223":24,"_163":224},"FILE_SIZE","FILE_LENGTH","png","DTS_AVAILABLE_END","DTS_AVAILABLE_START","7659ba9c-b463-417b-b80e-7e576e992744","FILE_HANDLER","Image Viewer",48533,"FILE_TYPE","Image","FILE_ORIGINAL","January, 21 2025 18:08:08",{"_180":24,"_212":37,"_213":37,"_182":226,"_190":24,"_215":24,"_216":24,"_34":24,"_40":227,"_218":115,"_187":203,"_188":228,"_41":228,"_45":229,"_221":230,"_191":24,"_47":231,"_223":24,"_163":232},"pdf","68118a92-5895-4fce-8698-2536fa12628c","AlgorithmsNotesForProfessionals.pdf",48534,"PDF","external_file","January, 21 2025 18:08:11","DTS_MODIFIED","February, 03 2026 18:47:04","PREVIEW_FILES_AUDIO",[],"TYPE_ID","PREVIEW_FILES_VIDEO",[],"METADATA",{"_149":74,"_150":151,"_152":151,"_153":154,"_155":37,"_156":74,"_157":158,"_160":161,"_159":37},"PREVIEW_FILES_PDF",[],"creator",{"_56":57,"_58":246,"_60":247,"_309":74,"_63":37},[],{"_248":24,"_71":37,"_249":250,"_103":37,"_251":24,"_252":24,"_253":6,"_254":106,"_255":136,"_45":29,"_256":24,"_257":37,"_104":22,"_258":24,"_259":24,"_260":261,"_262":37,"_102":20,"_263":24,"_264":265,"_266":267,"_105":106,"_107":53,"_268":24,"_269":57,"_270":37,"_271":57,"_272":136,"_240":273,"_308":24},"HANDLE_FACEBOOK","KYC_RESULT","verified","LAST_NAME","FIRST_NAME","IS_PHONE_VALIDATED","NUM_CLAIMS","NUM_PROJECTS","CREATOR_BACKGROUND","NUM_PURCHASES","HANDLE_LINKEDIN","HANDLE_TIKTOK","CREATOR_DESCRIPTION","

We specialize in publishing scientific e-books designed to simplify knowledge and make it accessible to everyone. Our high-quality content covers a wide range of scientific and technical fields, tailored for students, professionals, and researchers. Our vision is to empower readers to develop their skills and understanding through reliable and up-to-date resources that combine scientific accuracy with a clear and engaging style.

","TOTAL_EARNED","HANDLE_INSTAGRAM","PROJECT_TYPES",[48],"DTS_REGISTERED","January, 20 2025 22:06:24","HANDLE_YOUTUBE","IS_KYC_COMPLETE","NUM_SALES","IS_EMAIL_VALIDATED","NUM_COLLECTIONS",{"_274":275,"_276":74,"_277":278,"_279":280,"_281":282,"_283":282,"_284":282,"_285":282,"_286":74,"_287":37,"_288":280,"_289":275,"_290":282,"_291":282,"_292":282,"_293":282,"_294":282,"_295":74,"_296":74,"_297":37,"_298":24,"_299":24,"_300":74,"_301":24,"_302":303,"_304":280,"_305":37,"_306":74,"_307":57},"fund_step2_status","Denied","subscription_plan_selected","fund_agree_dts","January, 20 2025 22:24:31","fund_step1_status","Complete","fund_step3_status","Pending","fund_step4_status","fund_step5_status","fund_step6_status","is_fund_participant","is_fund2_participant","fund2_step1_status","fund2_step2_status","fund2_step3_status","fund2_step4_status","fund2_step5_status","fund2_step6_status","fund2_step0_status","subscription_plan_version","fund_agree_to_terms","fund2_agree_to_terms","fund_promoted_social","book_funnel_api_key","received_welcome_playlist","fund2_agree_dts","fund_followed_social","instagram","fund_step0_status","fund2_followed_social","is_creator","statement_tutorial_complete","HANDLE_TWITTER","RESULT_COUNT","actionData"]

Algorithms Notes for Professionals book

Collections