Dark Mode

Recent questions tagged sorting

0 votes

0 answers

1

I have a algorithm and i want to prove with induction, need help!
Hello, i have a algorithm and i want to prove it with induction how can i do that ? Also i want to worst case run time analyze but i am not very good please help me please. Thank you so much!

mdboi asked in Algorithms Oct 30, 2022

by mdboi

94 views

0 votes

0 answers

2

PhD Admissions Written Test (Basic)
Let A be a sorted array of distinct integers of length n. Design an algorithm to find an index i such that A[i] = i if such an index exists. If there are more than one such indices, you may output any one ... −1. The asymptotic time complexity of the fastest algorithm for this problem, assuming the array is already available, is Θ ______________________________

rsansiya111 asked in Others Sep 10, 2022

199 views

0 votes

0 answers

3

Data structures and algorithms
Assume Two-Dimensional Sorted Array (TDSA) is a two-dimensional matrix of size n × n such as the elements in the matrix are sorted row-wise and column-wise. For example, the following matrix is a TDSA. 1 2 3 4 5 6 7 8 9 Write an algorithm that should convert the given matrix of a dimension n × n into TDSA. Analyse the running time of the algorithm.

Karthi2003 asked in DS Sep 9, 2022

192 views

0 votes

1 answer

4

Algorithms
Given ‘N’ objects, which are coloured as red, white and blue. Sort these objects so that objects of the same colour are adjacent, with the colours in the order red, white and blue. Design an algorithm with a time com- plexity of O(nlog n)

Karthi2003 asked in DS Sep 9, 2022

310 views

1 vote

1 answer

5

TIFR CSE 2022 | Part B | Question: 3
Consider the problem of sorting $n$ single digit integers (base $10$). This problem can be solved in time $O(n \log n)$ but not $O(n \log \log n)$ $O(n \log \log n)$ but not $O(n)$ $O(n)$ but not $O(n / \log \log n)$ $O(n / \log \log n)$ None of the above.

admin asked in Algorithms Sep 1, 2022

by admin

264 views

2 votes

0 answers

6

TIFR CSE 2022 | Part B | Question: 11
Consider the following function $\textsf{count},$ that takes as input $a,$ an array of integers, and $\textsf{N}$, the size of the array. int count(int a[], int N) { int i, j, count_FN; count_FN = 0; for (i=1 ; i<N ; i++) { j=i-1 ; while ... $\textsf{N} \geq c$, for all arrays of size $\textsf{N, count_FN} \geq \textsf{N}^2 / c$ None of the above

admin asked in Algorithms Sep 1, 2022

by admin

212 views

1 vote

1 answer

7

data structure and algorithms -- linked list -- size of a node
as we allocate the space for node in linked list using malloc() so how many bytes malloc allocate for the 1 node i.e. actual value of malloc allocates in ram like i write this code. so what is size of a node of linked ... node *)malloc(sizeof(struct node)); printf("%d",sizeof(struct node)); } what the printf prints and why ?

ykrishnay asked in Programming Aug 5, 2022

274 views

0 votes

1 answer

8

Algorithm self doubt
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to reduce the time complexity to O(n)?

tusharb asked in Algorithms Feb 18, 2022

381 views

0 votes

1 answer

9

Gateoverflow Test series
Can anyone explain each option, for every option if it is true then why? If false then why? (Please don’t comment like answer is A,B etc) Please help

raja11sep asked in Algorithms Jan 15, 2022

550 views

1 vote

2 answers

10

LPU MATERIALS
Number of comparisons required to sort letters in ALGORITHM? (A) 36 (B) 8 (C) 45 (D) 9

Prerna naga asked in Algorithms Dec 30, 2021

283 views

0 votes

1 answer

11

Nptel Assignment Question
Consider the following algorithm on a graph with edge weights. Sort the edges as [e1,e2,...,em] in decreasing order of cost. Start with the original graph. Consider each edge ej. If this edge is part of a cycle delete it. Which of the following is not ... at the end is a minimum cost spanning tree. Exactly m-n+1 edges will be deleted. At most n-1 edges will be deleted.

rsansiya111 asked in Algorithms Dec 8, 2021

251 views

Page:

1
2
3
4
5
6
...
18
next »

Recent questions tagged sorting