| ??? 12/06/06 11:02 Read: times |
#129059 - my actual problem Responding to: ???'s previous message |
Abhishek Singh said:
may be s/he is looking for some sorting algorithm or insertion/deletion of an array element. Abhishek Hello sir yes sir my problem is something like that i have (buff[96]) array of 96 bytes, and in that locations i have stored some hex locations for my particular requirement and after that i want to shift the array element by one location and in the last location i have to insert another hex location from another array .. and it will continue till my all hex locations are inserted from another array locations .. Priyanka |
| Topic | Author | Date |
| shifting array elements using bitwise opeartor inC | 01/01/70 00:00 | |
| Why? | 01/01/70 00:00 | |
| Elaborate please. | 01/01/70 00:00 | |
| opeartor inC | 01/01/70 00:00 | |
| Possibly not | 01/01/70 00:00 | |
| Possibly not | 01/01/70 00:00 | |
| No, it doesn't | 01/01/70 00:00 | |
| *nitpick* | 01/01/70 00:00 | |
| Ah yes | 01/01/70 00:00 | |
| may be not! | 01/01/70 00:00 | |
| We will never know ... | 01/01/70 00:00 | |
| my actual problem | 01/01/70 00:00 | |
| do not shift at all | 01/01/70 00:00 | |
| Circular buffer | 01/01/70 00:00 | |
| it's bytewise then, isn't it | 01/01/70 00:00 | |
| That makes _a lot_ more sense. | 01/01/70 00:00 | |
| just a small remark | 01/01/70 00:00 | |
My bad. | 01/01/70 00:00 |