Algorithms Unlimited
Wednesday, July 5, 2023
Merge two sorted arrays
Problem
Merge One Sorted Array Into Another
First array has n positive numbers, and they are sorted in the non-descending order.
Second array has 2n numbers: first n are also positive and sorted in the same way but the last n are all zeroes.
Merge the first array into the second and return the latter. You should get 2n positive integers sorted in the non-descending order.
Example
{
"first": [1, 3, 5],
"second": [2, 4, 6, 0, 0, 0]
}
Output:
[1, 2, 3, 4, 5, 6]
Thursday, June 29, 2023
Mergesort algorithm in python
Mergesort algorithm is a divide and conquer algorithm. Its not efficient as Quicksort algorithm but in some cases Mergesort is better than Quicksort. For example if the data to be sorted is in a linked list then Quicksort is costly since in a linkedlist accessing random elements is costly and in Quicksort we have to access data randomly.
Asymptotic Complexity | ||
Something | Time Complexity | Space Complexity |
Worst Case Performance | O (n log n) | |
Best Case Performance | O (n log n ) | |
Average Case Performance | O(n log n) | |
Worst Case space Complexity | O (n) |
Monday, February 28, 2022
NLP BERT question answering with transformers
Using transfomers to do question answering based on a context.
Friday, May 21, 2021
Friday, April 30, 2021
Dutch Flag problem
Dutch flag is a notable problem wherein you have a array representing three colors . Red(R), Green(G) and Blue(B) which needs to be sorted with Reds coming first followed by Green and then Blue.
This is achieved by lumoto partitioning scheme.
Tuesday, April 20, 2021
Subscribe to:
Posts (Atom)