Question

How to find kth smallest element in unsorted array in o(logn)

Answer 1

Unsorted Array | Set 1 - GeeksforGeeks

We can find k'th smallest element in time complexity better than O(N Log N). A simple optomization is to create a Min Heap of ...

C program to find minimum element in array

#include <stdio.h>

int main()

{

int array[100], minimum, size,

Answer 2

Explanation:

smallest element in unsorted array