Praveen Kumar wrote: > 1.Write a c program that finds the smaller number > among given 3 integers > without using any relational operators. > > 2.find sum of n/2 smaller elements in the array of > size n .The time complexity must be less than O(n).
Hello Praveen, Show us what you have done so far, and we'll be glad to help you. It's hard to guess where you're going wrong without seeing your work so far. I'm sure you have made some initial effort, of course. I can't imagine that you would be asking us to do your homework for you. Homework is a learning experience, and of course you can't learn anything if somebody else does your work for you. So I'm glad you've made a start--show it to us and we'll help you along. Cordially, Kerry Thompson To unsubscribe, send a blank message to <mailto:[EMAIL PROTECTED]>. Yahoo! Groups Links <*> To visit your group on the web, go to: http://groups.yahoo.com/group/c-prog/ <*> To unsubscribe from this group, send an email to: [EMAIL PROTECTED] <*> Your use of Yahoo! Groups is subject to: http://docs.yahoo.com/info/terms/
