https://github.com/justehmadsaeed/bruteforcevrecursive-algorithms

Applied three different techniques⚡ to tackle the most efficient solution of finding the Subarray of an array, which holds the maximum sum of the whole array.
https://github.com/justehmadsaeed/bruteforcevrecursive-algorithms

algorithm-challenges algorithms algorithms-implemented brute-force-algorithm cpp hybrid-algorithms recursive-algorithm

Last synced: 27 days ago
JSON representation

Applied three different techniques⚡ to tackle the most efficient solution of finding the Subarray of an array, which holds the maximum sum of the whole array.

• Host: GitHub
• URL: https://github.com/justehmadsaeed/bruteforcevrecursive-algorithms
• Owner: justEhmadSaeed
• Created: 2020-02-19T12:09:38.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2020-02-22T19:14:49.000Z (almost 6 years ago)
• Last Synced: 2025-02-26T18:34:10.470Z (10 months ago)
• Topics: algorithm-challenges, algorithms, algorithms-implemented, brute-force-algorithm, cpp, hybrid-algorithms, recursive-algorithm
• Language: C++
• Homepage:
• Size: 348 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# BruteForce VS Recursive Algorithms

### We applied three techniques⚡ to tackle the problem of finding the Subarray of an array, which holds the maximum sum of the whole array.

- ## Brute Force Algorithm

        subArray FIND_MAX_SUBARRAY_BRUTE_FORCE(int *A, int low, int high);

- ## Recursive Algorithm

        subArray FIND_MAX_SUBARRAY(int *A, int low, int high);

        subArray FIND_MAX_CROSSING_SUBARRAY(int *A, int low, int mid, int high);

- ## Hybrid Recursive-BruteForce Algorithm

        subArray HYBRID_FIND_MAX_SUBARRAY(int *A, int low, int high);

        subArray FIND_MAX_CROSSING_SUBARRAY(int *A, int low, int mid, int high);

        subArray FIND_MAX_SUBARRAY_BRUTE_FORCE(int *A, int low, int high);