Write the recursive algorithm to find x^ n.
float power(float x, int n) { if(x=0) { return 0; } else if(n==0) { return 1; } if(n>0) { return x * power(x,n-1); } }
In which cases, QuickSort becomes a ‘SlowSort’ ? What Is the remedy In those cases?
Discuss the differences between command file and executable file.
What are the differences between AVL Tree & Binary Search Tree ?
What is a minimum spanning tree ? Describe Huffman’s Algorithm.
Copyright © 2025 MindStudy
A product by Shunya Intelliware Solution (Registered under MSME Uddyam)