Skip to content
Menu
Portfolio
  • Personal Projects
  • Assignments
  • Algorithms
  • Notes
  • Home
Portfolio

Category: Notes

Binary Optimization

Posted on March 4, 2025

Binary Optimization is particularly useful for the multiple knapsack problem. When an item has a selection limit s, meaning it can be chosen at most s times, the traditional approach requires O(n * s * m) time complexity. However, using binary optimization, the complexity can be reduced to O(n * log(s) * m) The core…

Knapsack Problem

Posted on January 29, 2025March 4, 2025

My own notes for Knapsack Problem.

Binary Search

Posted on July 17, 2022March 31, 2025

My own notes for Binary Search.

Merge Sort

Posted on July 11, 2022February 7, 2025

My own notes for Merge Sort.

Sorting And Searching Algorithms – Time Complexities Cheat Sheet

Posted on July 11, 2022September 23, 2022

Time complexity Cheat Sheet & BigO Graph.

Quick Sort

Posted on July 11, 2022March 6, 2025

My own notes for Quick Sort.

Markdown Guide

Posted on July 8, 2022April 11, 2025

This guide is powered by Markdown.

Reverse Proxy Code

Posted on June 29, 2022September 23, 2022

This is the code for Reverse Proxy.

CATEGORIES

  • Personal Projects
  • Notes
  • Algorithms

  • University of Maryland
  • CMSC426 - Computer Vision
  • CMSC320 - Introduction to Data Science
  • CMSC330 - Organization of Programming Languages
  • CMSC216 - Introduction to Computer Systems
©2025 Portfolio | WordPress Theme by Superbthemes.com