- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
- Upvotes Received
- 2
- Posts with Upvotes
- 1
- Upvoting Members
- 2
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
I am trying to create clickable textviews in Android. I'm a complete noob when it comes to java and the Android platform, so please take it easy on me. Here's what I have right now: [code=java] public class Hypertension extends Activity { /** Called when the activity is first created. … |
|
Is there a systematic method to analyze the time complexity of a program strictly from output data such as run-time, the number of data swaps, data comparisons, etc? For example... [icode] Data Size | Run Time | Comparisons | Moves --------------------------------------------- 1000 | 0.00 | 15448 | 23965 10000 | … |
|
Re:
Hi I found this example on about.com . I understand most of this, but one part is giving me problems in genral. I tried classes before, and it did not go over so well. But since this is someone else code, it might be better than mine :). Thanks [CODE] … |
|
Re:
Hey I'm having trouble using scanf to input two number and it is only letting me input 1. here is my code [ICODE] #include <stdio.h> int main() { int i ; int j ; int tl[10][25] ; int br[40][5] ; int point1[100][100] ; for(i=0;i<40;i++) for(j=0;j<25;j++) { printf("please enter value x,y … |
|
As you probably know, Shell sort is typically written with a base of insertion sort, as shown below: [code]for (ctr = numGaps - 1; ctr >= 0; ctr--) { k = gapSeq[ctr]; /* Insertion Sort Begins Here */ for (j = k; j < size; j++) { tmp = array[j]; … |