Shrikant Padhy

https://www.hackerrank.com/shrikantpadhy18,

RAITian,Navi Mumbai,2021 kalyan RAITian | DS ALGO & DEV ENTHUSIAST | BLOGGER

Results 5 comments of


                                            Shrikant Padhy

A forensic lab wants to know whether a deceased person’s DNA matches a set of known relatives. It is known that the closest relatives will have most of the DNA matching, and as the relationship becomes farther, the matching genes will be lesser. For this, the DNA pattern of the deceased is given and the DNA pattern of 10 likely relatives are given. Write a program to identify the family of the deceased.

> Can i work on this yes you can

Write the code for bubble sort, insertion sort, quicksort(with random pivot), mergesort and heapsort for sorting N numbers. Vary the value of N from 500, 1000, 5000, 10000, 50000, 100000, 500000, 1000000, 5000000; and for each value perform 10 observations of execution time for the search operation. Plot the result in a graph.

Yes You Can On Tue, Sep 22, 2020 at 6:53 PM Busi Reddy wrote: > Can I do this? > > — > You are receiving this because you authored...

Max Heap Data Structure using C

[Heap.docx](https://github.com/fnplus/interview-techdev-guide/files/3747541/Heap.docx)

Max Heap Data Structure using C

#

Socketio client example equivalent to https://python-socketio.readthedocs.io/en/latest/intro.html#client-features ?

Need socketio client examples for golang