Network profile

Prashin Jeevaganth

Reputation

217

Top tag

algorithms

Next privilege

250 Rep.

View close votes

Badges

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

2 votes cast

9 Questions

Votes Activity Newest Views

votes

answer

views

Efficient algorithm to replace list of integers with nearest bigger element

algorithms arrays

Feb 27 '19 at 17:29 John L. 25k

votes

answer

views

Implementation of QuickSort to handle duplicates

algorithms sorting quicksort algorithm-design

Feb 25 '19 at 14:16 John L. 25k

votes

answer

999

views

Appreciation of the 5 state process model

terminology operating-systems process-scheduling

Feb 17 '19 at 15:58 Gert 56

vote

answer

views

Python: A doubt on time and space complexity on string slicing

algorithm-analysis runtime-analysis space-analysis

Aug 12 '18 at 8:14 Raphael♦ 69.3k

vote

answers

views

What extent of difference is considered significant in runtime?

functional-programming

Feb 13 '18 at 16:33 Prashin Jeevaganth 217

votes

answer

170

views

QuickSort of linked lists optimised for duplicates

algorithms quicksort pseudocode

Nov 29 at 16:02 Community♦ 1

votes

answers

views

Bubble sort that ignores rightmost sorted parts

algorithms sorting

Feb 28 '19 at 7:00 Prashin Jeevaganth 217

votes

answers

305

views

Doubt on analysis on time and space complexity of creating n² tuples

algorithm-analysis runtime-analysis recursion

Mar 28 '18 at 10:15 Prashin Jeevaganth 217

votes

answers

332

views

What is the change in time complexity due to substitution of variables?

algorithms algorithm-analysis runtime-analysis

Feb 13 '18 at 13:55 Prashin Jeevaganth 217

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

9 Questions

Efficient algorithm to replace list of integers with nearest bigger element

Implementation of QuickSort to handle duplicates

Appreciation of the 5 state process model

Python: A doubt on time and space complexity on string slicing

What extent of difference is considered significant in runtime?

QuickSort of linked lists optimised for duplicates

Bubble sort that ignores rightmost sorted parts

Doubt on analysis on time and space complexity of creating n² tuples

What is the change in time complexity due to substitution of variables?