SELF DOUBT

eyeamgj asked Nov 9, 2018

248 views

0 votes

https://gateoverflow.in/83993/gate1990-2-viii

WHAT IS CORRECT ANSWER FOR HEAP?

eyeamgj asked Nov 9, 2018

eyeamgj

248 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

Heap construction, implemented naively, will take $O(nlogn)$.

But a better way of doing it can finish the construction in $O(n)$, and that's what the answer should be.

See: https://stackoverflow.com/a/18742428/4109843

goxul answered Nov 9, 2018

goxul

See all

1 1 comment

eyeamgj

commented Nov 9, 2018

YA THANK U

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

1 answer

Gopal6854 asked Sep 13, 2023

336 views

Self doubt
#include <stdio.h> void SSort(int [], int); void swap(int *,int*); int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]); SSort(arr,n); for(int i = 0; i < n; i++) { printf("%d\t", arr[i]); } return 0; } void SSort( ... = *x; *x = *y; *y = tmp; } This is a selection sort algorithm. But the output of the algo is: 0 0 0 0 0 0. Where is the problem ?

#include <stdio.h>void SSort(int [], int);void swap(int *,int*);int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]); SSort(arr,n); for(...

Gopal6854

336 views

Gopal6854 asked Sep 13, 2023

DS
sorting
self-doubt
algorithms

+ –

0 votes

1 answer

viral8702 asked Jul 22, 2023

323 views

Self Doubt
I have a doubt on simple Queue Implementation by an array Assume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last element If we dequeue the element then front's element will get deleted, Now do we have to ... space is empty) I am not talking about circular queue concept,I am just talking about simple queue implementation using array(Not circular).

I have a doubt on simple Queue Implementation by an arrayAssume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last elementIf we dequ...

viral8702

323 views

viral8702 asked Jul 22, 2023

DS
queue
self-doubt
data-structures

+ –

0 votes

1 answer

gagan55 asked Jul 13, 2023

950 views

self-doubt Data structure Linked list. Inserting a node at the beginning of a linked list
How to Visualize this code ? #include<stdio.h> #include<stdlib.h> struct node{ int data; struct node *next; }; void addFirst(struct node **head,int val){ struct node *newNode =malloc(sizeof(struct node ... ); addFirst(&head,30); addFirst(&head,40); addFirst(&head,50); printList(head); }

How to Visualize this code ?#include<stdio.h #include<stdlib.h struct node{ int data; struct node *next; }; void addFirst(struct node head,int val){ struct node *newNode...

gagan55

950 views

gagan55 asked Jul 13, 2023

DS
data-structures
linked-list

+ –

0 votes

1 answer

Abhrajyoti00 asked Oct 29, 2022

741 views

Self-Doubt: Stack Overflow in LinkedList
Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?

Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?

Abhrajyoti00

741 views

Abhrajyoti00 asked Oct 29, 2022

DS
stack
data-structures
linked-list

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 1 comment reply

Please log in or register to add a comment.

Related questions

0

1 1 comment