Charan

General Cloud Migration Steps:

— Have a good migration plan/goals
— Have metrics or KPIs
— Choose a cloud architect and team
— Choose cloud provider/providers
— Choose applications/apps to migrate
— Backup and Migrate the data
— Review the metrics and evaluate the success

Sources: Google Search

--

--

If a problem can be divided into multiple sub-problems then we can apply Dynamic Programming approach by storing the results of these sub-problems which can be used later. This reduces the time complexity from exponential to a polynomial time.

--

--

print(sorted([5,4,3,2,1]))
[1, 2, 3, 4, 5]

Developers who are working on Python might have used the sorted function in their code at some time or people who are working on data structures and algorithms problems/interviews might have come across this function.

This sorted function is based on the Time sort algorithm which was created by Tim peters. This particular soring algorithm is a hybrid sorting algorithm based on insertion and mergesort algorithms internally. This is really fascinating.

Following are the time and space complexities of this particular algorithm.

Time Complexities :

Best Case: O(n)
Avg Case: O(nlogn)
Worst Case: O(nlogn)

Space complexities: O(n)

References:

--

--