int sift(int a[], int b[], int n, int p) {
int i,k,x, tmp,index=0,count=0;
for(x=0; x<n; ++x)
b[x]=a[x];
[Code] .....
This is a function for a quicksort... Everything works; however, when I return index it returns the value for 'n'... I printed the value for index right before the function returns it and its 4, as it should be.
(while)
T minus 10 and counting
T minus 9 and counting
T minus 8 and counting
T minus 7 and counting
T minus 6 and counting
T minus 5 and counting
T minus 4 and counting
T minus 3 and counting
T minus 2 and counting
T minus 1 and counting
Declare the following index before the while loop:
int index = 10;
Correctly code a while statement below using the variable index as defined above, to produce the output shown above.
So this is what my code looks like... I also have to convert this same loop into a do while and for loop. So if I can get this one right I think the others should come relatively easy.
while (int index >= 10) {
cout << "T minus " << index;
index--;
}
Should i never return a pointer to a local variable. i have seen the following code in the standard text book.
Code:
struct node *add_to_list(struct node *list, int n)
{
struct node *new_node;
new_node = malloc(sizeof(struct node));
// some code here
return new_node;
}
new_node is a local pointer then why is he returning the new_node? Is it wrong or am i failing to understand something?
I know that this code is wrong because it returns the address of local variable which no longer exist after function:
int *f1()
{
int x = 2;
return &x;
}
However, why this one does not show problem and runs fine, here the pointer p is also a local variable:
int *f2()
{
int x = 2;
int *p;
p = &x;
return p;
}
Okay, I've been working on this Texture class that's going to be compatible with both SDL and OpenGL with the capability to create an array of textures within one class as opposed to multiple classes and such.
Now I've run into a slight issue if I want to return the value of a texture. There's two different types of textures: SDL_Texture, and a standard GLuint Texture. The problem I have is that one or the other is used, not both which is depending on whether or not the person is using OpenGL.
So when the user wants to get the texture, I need the ability to return either an SDL_Texture, or GLuint depending on whether or not OpenGL is being used.
I tried this with a template class, but it didn't work, but I'll post the code so you can see what I'm trying to do.
template <class Tex> Tex Texture::GetTexture(int TextureNumber)
{
if (TextureNumber > NumTextures || TextureNumber < 0)
return;
[Code]....
It basically just comes down to the last four lines of code. If the person is Using OpenGL return a GLuint, if the person is using SDL, return an SDL_Texture.
I would prefer to have the GetTexture function to be one function instead of two separate ones so I don't have to call a different function every time to check if I'm using SDL or OpenGL.
I have a homework requiring me to use quicksort on a pointer array of CDs. They are sorted by the title. I have tried the general solution for integer arrays which sets the pivot at the middle integer but it didn't work/ stopped working when I tried to start sorting the already inputed CDs. The same is happening with the current version (an adaptation of pieces of code):
void swap(CD &a, CD &B)/>
{
CD temp;
temp = a;
[Code]....
I've implemented it a bit differently: I create 2 temporary arrays, one for the numbers lower from the pivot , an done for numbers greater then the pivot. in the end of each iteration the 2 arrays are copied to the original array:
Code: #include <iostream>
void QuickSort (int* A , int start, int end){
if (end-start<3){
return;
}
int mid=(start+end)/2;
int pivot=A[mid];
int lA[end-start] , rA[end-start], rCounter=0,lCounter=0;
int curr=0,i=start;
[code]....
void Quicksort(int info[],int left,int right){
int pivot = left + (right - left)/2;//it is the middle (will change sometimes but will end up in the middle
int temp;
while(left<=right){
while(info[left] < pivot){
[Code] ....
This is my quicksort function. I have tried a lot of things but I am trying to get it to work to sort all the details I have stored in an array by there age. This is how I have entered the data.
void DataEntry(Details info[],int size){
int x;
int i;
i=0;
cout << "How Many Entries Would You Like to add";
[Code] ....
I am stuck on what to do with it
I am trying to code a partition quicksort but the problem here is at the output is in an infinite loop:
The input : 4 3 5 7 2
The expected output : 2 3 4 5 7
But my output is infinite :
2 3 4 5 7
2 3 4 5 7
2 3 4 5 7
.
.
and so on
[Code:
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
/* Head ends here */
void partition(vector <int> ar) {
[Code] .....
I was trying to debug a code which was behaving in an abnormal way
Code:
#define NOOFELEMENTS 32
unsigned char array[NOOFELEMENTS];
unsigned char array1[23];
init() {
for(i=0;i<=32;i++)
{
array[NOOFELEMENTS] = 0
}
}
I could trace the above one of the mistakes where the array initialization is crossing the array limits and writing into array[32] which is not available. My question does it overwrite into array1 as it is declared below array or it can write into any other location.
I am trying to get the index of a value by inputting the value:
For example if i have
int arr[5]={22, 85, 58, 78, 69};
indexOfItem(arr, 78);
and have the output be:
the index of the item is: 3
If i have current index and row/columns count how do i get on which row and on which column index is individually?
This is what i have tried, but column index is incorrect:
#include <iostream>
int main()
{
int rows = 5;
int colm = 6;
int inx = 12;
int rowInx = inx % rows;
int colInx = inx % colm;
std::cout << "row: " << rowInx << std::endl;
std::cout << "col: " << colInx << std::endl;
return 0;
}
Code:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace Chapter7Problem13
[Code] .....
I keep getting an out of bounds error in my code
I'm suppose to enter number of orders then enter those orders then calculate a discount and net price display the orders, discount, net price then the totals at the bottom ....
I want to get the starting index of structure elements, whoz id are 0,1,2,3 Like in below code col_data[0] (starting id=0) col_data[3] (starting id=1) col_data[5] (starting id=2) col_data[8] (starting id=3) Code:
Code:
typedef struct gg{
int id;
int value;
}
[code]....
How can i skip remaining loop iterations when it get that index and will go back to loop again for getting next element index?
I need function to determine where to place new element in sorted array. I want to use binary search to find index where element should be placed, when push all others.
Prototype should be something like
int WhereToPlaceElement(ElementType hash); // uses private atribute ElType** elements
I have tried my best to write, but all tries ended in inf loops and reading invalid locations of array.
How can I use one index to iterate between all the values
for example:
//I defined
vector<typeA> VA(XD,typeA());
vector<typeB> VB(XD,typeB());
//then the standard method to iterate is:
for(vector<typeA>::Size_type i=0; i<VA.size(); i++) {
VA[i].functionA();
VB[i].functionB();
}
the other way, use int,
//I defined
vector<typeA> VA(XD,typeA());
vector<typeB> VB(XD,typeB());
//then the standard method to iterate is:
for(int i=0; i<VA.size(); i++) {
VA[i].functionA();
VB[i].functionB();
}
none of above make me feel formal...
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace Mind_Puzzle {
public partial class Form1 : Form
[Code] .....
When i try to start it, it doesn't start or it gives an error on "UsedList[i] = false;".
The error: "An unhandled exception of type 'System.IndexOutOfRangeException' occurred in Mind Puzzle.exe
I am suppose to make a value to attach to a array and then have it stop on the last one with an error if it were to go past (done more or less).
Problem is I am suppose to use a int to hold the value of the array and then add 1 each time but my question is, if you were to add another number to increase your current array slot, what would that look like as I image that going array[0] + 1 isn't going to make it array[1].
I need understanding the logic behind this function. The function is supposed to "Return a pointer to the character at the index given" . For example, what exactly are we declaring at "(char * const c, int index)"? where does "index" come from or equal to in the body of the function?
Code:
1
2
3
4
5
6
7
8
char * GetValueAtIndex(char * const c, int index)
{
int i = 0;
char *p = c;
while (i++ != index)
p++;
return p;
}
Im problem with parsing. I read file line by line and i store another class bu when i parse the line last word gone example "I study algebra and discrite math" math didnt store.Why ? i want to calculate index section for document how can i solve this problem??
Code:
void DocumentIndex::parse(){
size_t pos = 0; //position
pos =line.find(" ");
while( ( pos = line.find(" ") ) != std::string::npos )
{
[code]....
I need to sort the elements in a 2d array by their index (starting from 1) for example:
Code:
1 5 3
4 7 8
4 10 2
10 is the biggest element and its index is 32, after 10 comes 8 with index 23 etc etc...
Looking for examples for two orders ... By descending and ascending order...
my question is located as a comment beside the last printf ! ? check the comment near the last printf the comment is ==>here i get a sequence of numbers the question is how can i copy this sequence to an array and the print the array out ?
Code:
#include <stdio.h>
#define N 30
#define n 100
[Code]....
here i get a sequence of numbers the question is how can i copy this sequence to an array and the print the array out ?
Here's my code
bitIndex = 5;
Code:
bool getBS(PBitSet _this, int bitIndex) {
if(_this->bits & (1 >> bitIndex))
return true;
else
return false;}
I want this code to return the value of the bit at position bitIndex. It can be either false or true. The problem is, that it always returns false, even thought I enter 16 as my number, so the 5th bit should be true.
0000|0000 = 0
0001|0000 = 16
I am storing info in a vector but I want to store certain info at a particular index. I am new to using vectors and am unsure about have to do this. I am aware of the insert method but am confused on how to use it to store at a particular index.
View 1 Replies View RelatedTask: - Write a function `index` that converts an int from 0 to 5 into its word. (It should take an int and return a string.)
0 -> "zero"
1 -> "one"
2 -> "two"
3 -> "three"
4 -> "four"
5 -> "five"
anything else -> "other"
#include <iostream>
using namespace std;
string index(int x) {
if(x=0)
return "zero ";
else if(x==1)
[Code] .....
It compiles but doesn't print anything.
I am new in c++ and I am having difficulties with finding values in two vectors. Basically, I have two constant integer vectors u and v . They have the same length. I would like to select all the values in u and v, that respect those statements:
u>= x1 & u<= x2 & v>= x3 & v<= x4
x1, x2, x3, x4 are predefined integers.
Below is the code i use to do that in Matlab:
idx = find(u>=x1 & u<=x2 & v>=x3 & v<=x4);
A=u(idx);
B=v(idx);
But how to translate that in c++.