Skip to content
#

divide

Here are 59 public repositories matching this topic...

Divide and Conquer algorithms solve problems by dividing them into smaller sub-problems and solving each sub-problem independently. The solutions to the sub-problems are then combined to form the solution to the original problem. This technique is widely used in algorithms for sorting, searching, matrix multiplication, and many other areas.

  • Updated Feb 9, 2023
  • Kotlin

This repo contains all common algorithms like searching , sorting , divide and conquer , greedy etc. and their implementation in C language with code to find their time complexity

  • Updated Jul 4, 2019
  • C

The Americans with Disabilities Act (ADA) applies to websites. A digital divide occurs when websites deny access, isolate and deprive users who live in rural areas, have older computers, are sick, visually impaired, with temporary or permanent physical limitations such as - broken bones, cancer, lymphedema, cataracts, strokes, and palsy.

  • Updated Mar 6, 2019
  • HTML

Improve this page

Add a description, image, and links to the divide topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the divide topic, visit your repo's landing page and select "manage topics."

Learn more