SEARCH ALGORITHMS DESIGNED TO RETRIEVE INFORMATION STORED WITHIN A DATA STRUCTURE SORT ALGORITHMS THIS IS USED TO REARRANGE ARRAYS OR A GIVEN LIST OF ELEMENTS ACCORDING TO A COMPARISON OPERATOR FUNCTION. THE COMPARISON OPERATOR IS USED TO DECIDE THE NEW ORDER OF ELEMENTS GREEDY ALGORITHMS AN ALGORITHM PARADIGM THAT BUILDS UP A SOLUTION PIECE BY PIECE, ALWAYS CHOOSING THE NEXT PIECE THAT OFFERS THE MOST OBVIOUS AND IMMEDIATE BENEFITS. RECURSIVE ALGORITHMS AN ALGORITHM WHICH CALLS ITSELF WITH SMALLER OR SIMPLER INPUT VALUES. THE RESULT IS RETURNED BACK UP THE CHAIN OF CALLS UNTIL IT HITS THE ORIGINAL PROBLEM. DYNAMIC PROGRAMMING CAN OPTIMIZE RECURSION. DYNAMIC PROGRAMMING STORES THE RESULT OF SUB-PROBLEMS FOR RE-COMPUTATION, FOR FUTURE USE. THIS SIMPLE OPTIMIZATION REDUCES TIME COMPLEXICITIES FROM EXPONENTIAL TO POLYNOMIAL TIME.
Intellectual | Influencer | Inspirational