1,887 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
0
votes
1
answer
150
views
can newlib-nano printf function work without heap allocation
i was looking at this heap implementation, and i was wondering if it is necessary to implement heap for printf even if i'm calling setvbuf(stdout, NULL, _IONBF, 0) before calling printf.
i looked at ...
1
vote
2
answers
84
views
Why defining string within a function scope allocates it on heap instead of a stack? [duplicate]
According this awesome article there is an interesting case with two given examples:
A:
B:
And there is an explanation for A:
Unfortunately you have not taken into account that such Strings will ...
0
votes
1
answer
49
views
How does a microcontroller keep track of heap free()?
In a microcontroller without any OS, how does the microcontroller keep track of where a malloc will point to in the heap?
char *x;
char *y;
char *z;
x=(char*)malloc(10);
y=(char*)malloc(10);
free(x);
...
2
votes
4
answers
195
views
How can I efficiently maintain median in a dynamic data stream with support for deletions?
I'm working on a problem where I need to maintain the median of a data stream, but unlike typical implementations that only support insertions, I also need to support deletions of arbitrary values.
...
1
vote
1
answer
225
views
EIGEN: Advice needed for memory allocation
I am trying to write an efficient multistep solver in C++ using the Eigen library. To do so, I need a few variables that keep track of the history. One of them is of type Eigen::VectorX<Eigen::...
4
votes
1
answer
108
views
gdb: get references to value returned by the find command
I'm trying to port a program I wrote in windows with syscalls to linux. The program reads the memory of another running process and displays certain values as they change. To get started and figure ...
1
vote
1
answer
102
views
Does the call instruction write something onto the stack? For example, things like environment variables?
I am currently running a C++ program in which I have used the heap to simulate the stack and employed assembly language to place relevant information (such as memory addresses) into registers, thereby ...
0
votes
1
answer
81
views
Data streaming - is this the right way to build CSV file using ByteArrayOutputStream?
I do have this code.
@RequestMapping("/test")
fun getData(): ResponseEntity<ByteArray> {
val items = repository.getItems()
val outputStream = ByteArrayOutputStream()
...
1
vote
3
answers
141
views
Why is the heap in heapsort "the wrong way"?
In heapsort, the heap is max-heap where each time we extract the maximum element from index 0 and place it at the right side of the array. I'm now wondering why we don't build the max-heap in reverse, ...
2
votes
1
answer
198
views
Which option has precendence if I enable and disable FrontEndHeapDebugOptions at the same time?
The undocumented (I can't find a MSDN reference) FrontEndHeapDebugOptions Registry key has two flags:
Bit 2 (0x04) for disabling the Segment Heap, thus forcing NT Heap
Bit 3 (0x08) for enabling the ...
1
vote
1
answer
129
views
Min Pairing Heap - How to increase key faster than O(logn)?
I know that a min pairing heap can decrease a key faster than O(logn). However, is there any way to make the increase key operate also faster than decrease key to the top, remove, than insert new ...
0
votes
1
answer
60
views
Why heapq.heappush is an O(log n) operation?
import heapq
minHeap = [4, 7, 2, 8, 1, 3]
heapq.heapify(minHeap) # O(n log n) operation
print(minHeap) # [1, 4, 2, 8, 7, 3]
heapq.heappush(minHeap, 1) # O(log n) operation?
print(minHeap) # ...
1
vote
0
answers
49
views
use a priority queue to do hierarchical clustering without import heapq
I am using priority queue to do the hierarchical clustering(can not import heapq), and want to use the complete-link method, but I don't know what is the problem of my code, the reason is far from ...
5
votes
0
answers
111
views
Why does the last element in a range need to fulfill the heap property for pop_heap?
The C++ standard explains how std::pop_heap is supposed to work:
Effects: Swaps the value in the location first with the value in the location last - 1 and makes
[first, last - 1) into a heap with ...
0
votes
1
answer
125
views
How a pointer to pointer pointing to a NULL pointer works in C?
I am trying to understand merging two sorted lists into one sorted output. Got the below code from internet. trav's value will have to be the address of mergedHead but here, trav is holding the value ...